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 4, 2026 08:18Victor MerckléVictor MerckléScore: 3,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 08:213,62338,448,31128,960,0001,119,0002,117,632stderr
2Sep 4, 2026 08:213,63838,592,33429,065,0001,137,0002,117,632stderr
3Sep 4, 2026 08:213,64338,687,54429,059,0001,184,0002,117,632stderr
4Sep 4, 2026 08:213,64339,355,00029,127,0001,112,0002,117,632stderr
5Sep 4, 2026 08:213,64538,641,16029,038,0001,223,0002,117,632stderr
6Sep 4, 2026 08:213,64938,767,62929,211,0001,077,0002,117,632stderr
7Sep 4, 2026 08:213,67438,868,78629,424,0001,077,0002,117,632stderr
8Sep 4, 2026 08:213,68438,948,58429,440,0001,138,0002,117,632stderr
9Sep 4, 2026 08:213,73839,429,93629,921,0001,111,0002,117,632stderr