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 2, 2026 01:09Victor MerckléVictor MerckléScore: 3,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 01:103,66938,855,29329,305,0001,154,0002,117,632stderr
2Sep 2, 2026 01:103,67339,616,70829,355,0001,138,0002,117,632stderr
3Sep 2, 2026 01:103,67638,865,31929,388,0001,131,0002,117,632stderr
4Sep 2, 2026 01:103,67839,608,43629,387,0001,145,0002,117,632stderr
5Sep 2, 2026 01:103,69939,096,17029,554,0001,152,0002,117,632stderr
6Sep 2, 2026 01:103,70039,194,41629,571,0001,141,0002,117,632stderr
7Sep 2, 2026 01:103,73840,174,19329,878,0001,148,0002,117,632stderr
8Sep 2, 2026 01:103,76840,303,83630,144,0001,138,0002,117,632stderr
9Sep 2, 2026 01:103,78240,429,37230,248,0001,143,0002,117,632stderr