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 listFeb 20, 2026 16:22Daniel MastalerzDaniel MastalerzScore: 7,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 16:227,00782,265,47555,149,0003,008,0002,314,240
2Feb 20, 2026 16:227,02579,187,99854,290,0004,021,0002,527,232
3Feb 20, 2026 16:227,13780,501,83456,229,0003,012,0002,322,432
4Feb 20, 2026 16:227,23398,651,40757,030,0003,001,0002,523,136
5Feb 20, 2026 16:227,33683,160,03656,899,0003,992,0002,523,136
6Feb 20, 2026 16:227,34486,165,44957,959,0002,997,0002,306,048