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 listApr 27, 2026 10:22wnwnScore: 3,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:233,43542,336,81227,495,0001,018,0002,486,272
2Apr 27, 2026 10:233,44345,066,44127,562,0001,020,0002,330,624
3Apr 27, 2026 10:233,46541,783,17126,783,0001,983,0002,486,272
4Apr 27, 2026 10:233,46748,439,22226,793,0001,984,0002,498,560
5Apr 27, 2026 10:233,48146,296,96226,902,0001,992,0002,498,560
6Apr 27, 2026 10:233,50645,151,65528,098,0001,003,0002,547,712
7Apr 27, 2026 10:233,50646,729,01327,095,0002,007,0002,473,984
8Apr 27, 2026 10:233,56547,407,13228,575,0001,020,0002,494,464
9Apr 27, 2026 10:233,64848,306,07729,275,0001,009,0002,494,464