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 13, 2026 21:15Victor MerckléVictor MerckléScore: 7,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:167,73773,558,69663,190,0001,029,0002,117,632stderr
2May 13, 2026 21:167,73872,445,22763,219,0001,010,0002,117,632stderr
3May 13, 2026 21:167,74472,876,22863,142,0001,134,0002,117,632stderr
4May 13, 2026 21:167,74574,547,56963,253,0001,032,0002,117,632stderr
5May 13, 2026 21:167,75074,916,59763,227,0001,106,0002,117,632stderr
6May 13, 2026 21:167,75671,487,11863,331,0001,051,0002,117,632stderr
7May 13, 2026 21:167,75672,107,70463,251,0001,129,0002,117,632stderr
8May 13, 2026 21:167,75973,762,25663,273,0001,127,0002,117,632stderr
9May 13, 2026 21:167,76971,753,97363,371,0001,117,0002,117,632stderr