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 listJul 5, 2026 20:53Victor MerckléVictor MerckléScore: 5,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:555,48853,661,43144,430,0001,126,0002,117,632stderr
2Jul 5, 2026 20:555,49353,659,46844,468,0001,126,0002,117,632stderr
3Jul 5, 2026 20:555,49453,719,18444,487,0001,116,0002,117,632stderr
4Jul 5, 2026 20:555,49853,662,87844,533,0001,108,0002,117,632stderr
5Jul 5, 2026 20:555,49953,713,63844,533,0001,111,0002,117,632stderr
6Jul 5, 2026 20:555,50553,745,40944,541,0001,151,0002,117,632stderr
7Jul 5, 2026 20:555,50653,741,24044,574,0001,126,0002,117,632stderr
8Jul 5, 2026 20:555,51153,807,16144,729,0001,016,0002,117,632stderr
9Jul 5, 2026 20:555,51253,808,26844,746,0001,010,0002,117,632stderr