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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 01:123,54139,310,74828,267,0001,127,0002,117,632stderr
2Sep 14, 2026 01:123,55539,934,42128,400,0001,112,0002,117,632stderr
3Sep 14, 2026 01:123,56239,423,49028,423,0001,143,0002,117,632stderr
4Sep 14, 2026 01:123,56739,451,32628,521,0001,091,0002,117,632stderr
5Sep 14, 2026 01:123,57339,445,43028,640,0001,021,0002,117,632stderr
6Sep 14, 2026 01:123,59339,525,03928,709,0001,120,0002,117,632stderr
7Sep 14, 2026 01:123,63740,115,62129,072,0001,123,0002,117,632stderr
8Sep 14, 2026 01:123,64239,981,58229,088,0001,147,0002,117,632stderr
9Sep 14, 2026 01:123,67840,300,03229,410,0001,119,0002,117,632stderr