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 18:44Josu San MartinJosu San MartinScore: 3,887Success
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 18:443,85342,350,62830,889,0001,094,0002,113,536
2May 10, 2026 18:443,86541,142,00830,990,0001,091,0002,113,536
3May 10, 2026 18:443,86739,671,83831,014,0001,089,0002,113,536
4May 10, 2026 18:443,87241,903,31331,078,0001,064,0002,113,536
5May 10, 2026 18:443,88742,954,18031,176,0001,093,0002,113,536
6May 10, 2026 18:443,88941,653,44031,201,0001,079,0002,113,536
7May 10, 2026 18:443,89140,710,93831,214,0001,083,0002,113,536
8May 10, 2026 18:443,90741,710,64931,339,0001,092,0002,113,536
9May 10, 2026 18:444,00443,201,31032,156,0001,085,0002,113,536