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 3, 2026 22:22Victor MerckléVictor MerckléScore: 6,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 22:226,39761,488,36452,038,0001,060,0002,117,632stderr
2Sep 3, 2026 22:226,40561,552,50452,128,0001,041,0002,117,632stderr
3Sep 3, 2026 22:226,41962,160,99552,217,0001,068,0002,117,632stderr
4Sep 3, 2026 22:226,44161,803,12252,283,0001,182,0002,117,632stderr
5Sep 3, 2026 22:226,44861,841,93352,298,0001,224,0002,117,632stderr
6Sep 3, 2026 22:226,45261,955,92152,373,0001,180,0002,117,632stderr
7Sep 3, 2026 22:226,51462,894,74353,016,0001,051,0002,117,632stderr
8Sep 3, 2026 22:226,53262,679,92653,208,0001,014,0002,117,632stderr
9Sep 3, 2026 22:226,55462,789,65153,187,0001,217,0002,117,632stderr