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 03:10Josu San MartinJosu San MartinScore: 4,822Success
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 03:114,59656,231,44937,060,0001,095,0002,469,888
2May 10, 2026 03:114,66552,846,98937,549,0001,177,0002,465,792
3May 10, 2026 03:114,68655,534,01837,717,0001,179,0002,473,984
4May 10, 2026 03:114,69653,596,37937,885,0001,100,0002,482,176
5May 10, 2026 03:114,82254,787,61238,932,0001,096,0002,465,792
6May 10, 2026 03:114,85152,924,42239,085,0001,180,0002,469,888
7May 10, 2026 03:114,89954,041,27539,486,0001,177,0002,465,792
8May 10, 2026 03:115,12659,917,68841,342,0001,209,0002,465,792
9May 10, 2026 03:118,59489,936,99970,130,0001,204,0002,469,888