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 listJul 3, 2026 18:54Josu San MartinJosu San MartinScore: 9,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 18:549,20386,100,39769,637,0006,752,0002,117,632
2Jul 3, 2026 18:549,23586,000,32869,943,0006,712,0002,117,632
3Jul 3, 2026 18:549,25386,217,21270,006,0006,799,0002,117,632
4Jul 3, 2026 18:549,27186,366,50570,111,0006,840,0002,121,728
5Jul 3, 2026 18:549,30486,614,66970,153,0007,076,0002,121,728
6Jul 3, 2026 18:549,31786,687,56870,443,0006,891,0002,121,728
7Jul 3, 2026 18:549,33086,795,63670,393,0007,046,0002,121,728
8Jul 3, 2026 18:549,35187,100,10770,531,0007,084,0002,121,728
9Jul 3, 2026 18:549,37587,177,56370,762,0007,057,0002,121,728