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 11, 2026 18:02Josu San MartinJosu San MartinScore: 3,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:023,86139,453,77231,045,0001,006,0002,113,536
2May 11, 2026 18:023,86141,348,05631,020,0001,033,0002,113,536
3May 11, 2026 18:023,86341,670,52230,974,0001,096,0002,113,536
4May 11, 2026 18:023,88340,562,47831,102,0001,130,0002,113,536
5May 11, 2026 18:023,88639,588,07831,186,0001,073,0002,113,536
6May 11, 2026 18:023,89640,056,42431,256,0001,082,0002,113,536
7May 11, 2026 18:023,91939,833,66231,419,0001,115,0002,113,536
8May 11, 2026 18:023,92140,019,71731,437,0001,111,0002,113,536
9May 11, 2026 18:023,96242,628,59231,764,0001,125,0002,113,536