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 21:52Victor MerckléVictor MerckléScore: 3,827Success
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 21:553,76639,787,58630,210,0001,056,0002,117,632stderr
2Sep 8, 2026 21:553,76839,852,64230,148,0001,134,0002,117,632stderr
3Sep 8, 2026 21:553,78339,896,12730,299,0001,100,0002,117,632stderr
4Sep 8, 2026 21:553,79341,179,51630,351,0001,135,0002,117,632stderr
5Sep 8, 2026 21:553,82740,314,79730,650,0001,115,0002,117,632stderr
6Sep 8, 2026 21:553,83440,406,25130,731,0001,097,0002,117,632stderr
7Sep 8, 2026 21:553,84440,625,83830,873,0001,034,0002,117,632stderr
8Sep 8, 2026 21:553,84640,400,32930,828,0001,096,0002,117,632stderr
9Sep 8, 2026 21:553,86240,556,14830,955,0001,102,0002,117,632stderr