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 16, 2026 15:46olliecrowolliecrowScore: 5,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 15:505,78275,973,90744,993,0002,999,0002,265,088
2Apr 16, 2026 15:475,78969,433,02843,044,0005,005,0002,367,488
3Apr 16, 2026 15:505,79569,797,03146,094,0002,004,0002,424,832
4Apr 16, 2026 15:465,80672,524,31044,173,0004,015,0002,514,944
5Apr 16, 2026 15:475,83170,827,35446,384,0002,016,0002,486,272
6Apr 16, 2026 15:505,85978,949,92445,591,0003,039,0002,363,392
7Apr 16, 2026 15:465,87775,749,53045,790,0002,986,0002,514,944
8Apr 16, 2026 15:465,89574,584,85643,933,0004,992,0002,510,848
9Apr 16, 2026 15:475,91170,177,30743,054,0006,007,0002,437,120