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 13, 2026 22:06Victor MerckléVictor MerckléScore: 3,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2026 22:093,45238,435,96427,530,0001,128,0002,117,632stderr
2Sep 13, 2026 22:093,46238,513,51127,618,0001,124,0002,117,632stderr
3Sep 13, 2026 22:093,46639,204,73827,635,0001,137,0002,117,632stderr
4Sep 13, 2026 22:093,47538,672,44627,703,0001,144,0002,117,632stderr
5Sep 13, 2026 22:093,52039,007,29728,083,0001,134,0002,117,632stderr
6Sep 13, 2026 22:093,53839,194,12528,236,0001,133,0002,117,632stderr
7Sep 13, 2026 22:093,54340,486,35828,267,0001,143,0002,117,632stderr
8Sep 13, 2026 22:093,58039,545,13928,589,0001,132,0002,117,632stderr
9Sep 13, 2026 22:093,59239,629,37528,674,0001,141,0002,117,632stderr