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 listMay 10, 2026 19:10Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 19:11041,230,16231,216,0001,074,0002,113,536expected "53689695638219476 ", got "53689694660373473 "
2May 10, 2026 19:113,84841,102,84830,857,0001,085,0002,113,536
3May 10, 2026 19:113,86142,332,08530,972,0001,077,0002,113,536
4May 10, 2026 19:113,87339,540,55831,079,0001,069,0002,113,536
5May 10, 2026 19:113,87342,180,93131,035,0001,118,0002,113,536
6May 10, 2026 19:113,87542,191,13731,081,0001,084,0002,113,536
7May 10, 2026 19:113,89640,036,69531,250,0001,092,0002,113,536
8May 10, 2026 19:113,90339,759,33131,324,0001,072,0002,113,536
9May 10, 2026 19:113,90542,073,79431,345,0001,069,0002,113,536