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 listJun 10, 2026 13:34Victor MerckléVictor MerckléScore: 4,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 13:344,75547,068,74438,414,0001,058,0002,113,536
2Jun 10, 2026 13:344,78147,525,68438,607,0001,078,0002,113,536
3Jun 10, 2026 13:344,79047,793,52538,695,0001,068,0002,113,536
4Jun 10, 2026 13:344,96348,772,17140,126,0001,069,0002,113,536
5Jun 10, 2026 13:344,97548,939,55340,228,0001,066,0002,113,536
6Jun 10, 2026 13:344,97648,858,90740,254,0001,049,0002,113,536
7Jun 10, 2026 13:345,00849,155,85040,528,0001,040,0002,113,536
8Jun 10, 2026 13:345,01049,172,96440,550,0001,035,0002,113,536
9Jun 10, 2026 13:345,01549,258,32140,591,0001,037,0002,113,536