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 24, 2026 13:54Victor MerckléVictor MerckléScore: 4,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 13:554,56745,905,03236,852,0001,060,0002,113,536
2May 24, 2026 13:554,57047,402,02336,857,0001,081,0002,113,536
3May 24, 2026 13:554,58247,611,67936,961,0001,070,0002,113,536
4May 24, 2026 13:554,58847,381,26437,021,0001,064,0002,113,536
5May 24, 2026 13:554,59647,697,50237,109,0001,045,0002,113,536
6May 24, 2026 13:554,60248,412,04037,196,0001,006,0002,113,536
7May 24, 2026 13:554,61346,945,28937,291,0001,001,0002,113,536
8May 24, 2026 13:554,77349,323,78938,614,0001,005,0002,113,536
9May 24, 2026 13:554,81548,354,25638,937,0001,034,0002,113,536