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 08:29Victor MerckléVictor MerckléScore: 4,580Success
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 08:334,46045,458,94230,384,0006,642,00024,576stderr
2Sep 8, 2026 08:334,50453,170,67830,753,0006,636,00024,576stderr
3Sep 8, 2026 08:334,54246,238,87830,981,0006,723,0002,117,632stderr
4Sep 8, 2026 08:334,55247,771,65631,363,0006,420,00024,576stderr
5Sep 8, 2026 08:334,58047,024,65230,493,0007,524,0002,117,632stderr
6Sep 8, 2026 08:334,59247,218,28631,469,0006,651,00024,576stderr
7Sep 8, 2026 08:335,05551,118,57031,825,00010,135,0002,117,632stderr
8Sep 8, 2026 08:335,09151,369,36532,062,00010,195,0002,117,632stderr
9Sep 8, 2026 08:335,09851,463,11432,055,00010,264,0002,117,632stderr