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 listSep 8, 2026 08:37Victor MerckléVictor MerckléScore: 4,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 08:404,47446,239,02230,832,0006,307,0002,117,632stderr
2Sep 8, 2026 08:404,47545,642,27830,575,0006,573,0002,117,632stderr
3Sep 8, 2026 08:404,52646,752,31430,559,0007,010,00024,576stderr
4Sep 8, 2026 08:404,54246,171,90330,888,0006,814,0002,117,632stderr
5Sep 8, 2026 08:404,55846,982,60131,228,0006,607,00024,576stderr
6Sep 8, 2026 08:404,58547,111,82930,855,0007,202,0002,117,632stderr
7Sep 8, 2026 08:404,74647,809,49930,499,0008,898,0002,117,632stderr
8Sep 8, 2026 08:404,74947,898,77731,224,0008,198,0002,117,632stderr
9Sep 8, 2026 08:4015,960727,038,50847,172,00085,299,0002,117,632stderr