Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 13, 2026 15:21Dominique GarmierDominique GarmierScore: 11,662Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 15:2111,615127,118,85995,398,0001,004,0002,367,488
2Mar 13, 2026 15:2111,642126,933,97794,633,0001,992,0002,392,064
3Mar 13, 2026 15:2111,642123,485,59495,619,0001,006,0002,506,752
4Mar 13, 2026 15:2111,661123,511,31795,789,000997,0002,412,544
5Mar 13, 2026 15:2111,662120,800,03895,794,000997,0002,506,752
6Mar 13, 2026 15:2111,696132,431,70596,080,0001,000,0002,416,640
7Mar 13, 2026 15:2111,698118,429,07495,092,0002,001,0002,289,664
8Mar 13, 2026 15:2111,751123,118,08296,528,0001,005,0002,289,664
9Mar 13, 2026 15:2111,898127,213,62997,754,000997,0002,289,664