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 7, 2026 19:43Victor MerckléVictor MerckléScore: 45,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 19:4545,220384,474,426370,852,0004,481,00024,576stderr
2Sep 7, 2026 19:4545,618387,394,227374,059,0004,571,0002,117,632stderr
3Sep 7, 2026 19:4545,920390,431,247376,526,0004,614,00024,576stderr
4Sep 7, 2026 19:4545,943390,544,049377,024,0004,309,00024,576stderr
5Sep 7, 2026 19:4545,946389,888,854376,882,0004,472,00024,576stderr
6Sep 7, 2026 19:4545,976390,230,013376,803,0004,801,0002,117,632stderr
7Sep 7, 2026 19:4546,066392,309,202378,160,0004,195,00024,576stderr
8Sep 7, 2026 19:4546,087391,136,201377,568,0004,959,00024,576stderr
9Sep 7, 2026 19:4546,103391,333,548378,180,0004,483,00024,576stderr