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 19:53Victor MerckléVictor MerckléScore: 3,660Success
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 19:563,63239,420,64429,007,0001,140,0002,117,632stderr
2Sep 8, 2026 19:563,64239,362,50229,095,0001,138,0002,117,632stderr
3Sep 8, 2026 19:563,66039,514,16129,248,0001,131,0002,117,632stderr
4Sep 8, 2026 19:563,66039,508,10929,238,0001,145,0002,117,632stderr
5Sep 8, 2026 19:563,66039,803,87429,260,0001,125,0002,117,632stderr
6Sep 8, 2026 19:563,66239,656,16829,264,0001,131,0002,117,632stderr
7Sep 8, 2026 19:563,66339,736,02329,267,0001,136,0002,117,632stderr
8Sep 8, 2026 19:563,66739,632,64129,407,0001,031,0002,117,632stderr
9Sep 8, 2026 19:563,67539,743,08829,368,0001,135,0002,117,632stderr