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 10:08Victor MerckléVictor MerckléScore: 4,647Success
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 10:114,50146,559,99229,646,0007,715,00024,576stderr
2Sep 8, 2026 10:114,52346,032,63729,800,0007,742,00024,576stderr
3Sep 8, 2026 10:114,62047,513,23129,806,0008,545,0002,117,632stderr
4Sep 8, 2026 10:114,63246,970,32329,868,0008,585,0002,117,632stderr
5Sep 8, 2026 10:114,64747,682,17729,881,0008,691,0002,117,632stderr
6Sep 8, 2026 10:114,68647,443,09330,117,0008,784,0002,117,632stderr
7Sep 8, 2026 10:114,70147,525,14129,511,0009,508,0002,117,632stderr
8Sep 8, 2026 10:114,74447,817,58429,040,00010,342,0002,117,632stderr
9Sep 8, 2026 10:114,77449,834,84229,904,0009,727,00024,576stderr