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:02Josu San MartinJosu San MartinScore: 3,874Success
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:033,85742,220,45930,950,0001,066,0002,113,536
2May 10, 2026 19:033,86340,432,60930,986,0001,081,0002,113,536
3May 10, 2026 19:033,86642,892,83731,001,0001,087,0002,113,536
4May 10, 2026 19:033,87139,433,21431,064,0001,070,0002,113,536
5May 10, 2026 19:033,87439,473,69131,072,0001,084,0002,113,536
6May 10, 2026 19:033,87741,550,78231,101,0001,080,0002,113,536
7May 10, 2026 19:033,88542,839,37731,164,0001,084,0002,113,536
8May 10, 2026 19:033,89942,218,28131,270,0001,094,0002,113,536
9May 10, 2026 19:033,96840,539,96131,852,0001,084,0002,113,536