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 10, 2026 16:30Danylo MocherniukDanylo MocherniukScore: 4,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 16:294,52860,846,70334,617,0002,967,0002,387,968
2Apr 10, 2026 16:294,53071,108,96136,584,0001,016,0002,297,856
3Apr 10, 2026 16:294,55567,292,28336,811,000994,0002,297,856
4Apr 10, 2026 16:294,55765,642,48534,841,0002,986,0002,297,856
5Apr 10, 2026 16:294,56061,498,30835,860,0001,992,0002,297,856
6Apr 10, 2026 16:304,56059,973,52534,859,0002,987,0002,273,280
7Apr 10, 2026 16:294,64561,178,94736,524,0002,029,0002,383,872
8Apr 10, 2026 16:294,69467,637,79835,965,0002,997,0002,387,968
9Apr 10, 2026 16:304,72761,853,71136,218,0003,018,0002,396,160
10Apr 10, 2026 16:304,80268,436,28136,865,0002,989,0002,383,872
11Apr 10, 2026 16:295,08272,422,54240,171,0002,008,0002,396,160
12Apr 10, 2026 16:295,16767,036,14440,893,0001,994,0002,297,856