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 14, 2026 08:21Victor MerckléVictor MerckléScore: 58,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 08:2158,273493,086,828482,666,0001,002,0002,117,632stderr
2May 14, 2026 08:2158,956497,261,307488,337,0001,003,0002,117,632stderr
3May 14, 2026 08:2158,962498,534,782488,386,0001,003,0002,117,632stderr
4May 14, 2026 08:2158,967497,247,862488,427,0001,003,0002,117,632stderr
5May 14, 2026 08:2158,971499,112,346488,463,0001,001,0002,117,632stderr
6May 14, 2026 08:2158,971498,462,485488,465,0001,002,0002,117,632stderr
7May 14, 2026 08:2158,976498,845,137488,507,0001,002,0002,117,632stderr
8May 14, 2026 08:2159,011499,973,891488,787,0001,006,0002,117,632stderr
9May 14, 2026 08:2159,122499,154,497488,710,0002,008,0002,117,632stderr