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 listMay 15, 2026 19:17Victor MerckléVictor MerckléScore: 90,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 19:1790,335757,154,280745,121,0004,666,0002,121,728stderr
2May 15, 2026 19:1790,402758,733,124744,771,0005,571,0002,121,728stderr
3May 15, 2026 19:1790,650759,700,440747,640,0004,758,0002,121,728stderr
4May 15, 2026 19:1790,696762,359,228748,045,0004,738,0002,121,728stderr
5May 15, 2026 19:1790,703760,194,166746,944,0005,891,0002,121,728stderr
6May 15, 2026 19:1790,824761,523,243748,371,0005,470,0002,121,728stderr
7May 15, 2026 19:1791,195765,956,921751,410,0005,511,0002,121,728stderr
8May 15, 2026 19:1791,443766,714,338753,125,0005,859,0002,121,728stderr
9May 15, 2026 19:1792,419775,861,234761,470,0005,611,0002,121,728stderr