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:47Victor MerckléVictor MerckléScore: 74,830Success
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:4774,737627,865,947609,914,00010,410,0002,117,632stderr
2May 14, 2026 08:4774,741629,399,023609,346,00011,007,0002,117,632stderr
3May 14, 2026 08:4774,778629,201,849610,228,00010,430,0002,117,632stderr
4May 14, 2026 08:4774,790628,616,160610,229,00010,532,0002,117,632stderr
5May 14, 2026 08:4774,830628,412,042610,328,00010,768,0002,117,632stderr
6May 14, 2026 08:4774,844629,072,499610,568,00010,644,0002,117,632stderr
7May 14, 2026 08:4774,846629,218,966610,526,00010,702,0002,117,632stderr
8May 14, 2026 08:4774,859630,818,117610,574,00010,756,0002,117,632stderr
9May 14, 2026 08:4774,865631,683,577610,432,00010,951,0002,117,632stderr