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 5, 2026 20:52Kevin HeaveyKevin HeaveyScore: 4,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:544,48146,794,33335,961,0001,238,0002,117,632
2Jul 5, 2026 20:544,48946,881,31736,016,0001,243,0002,117,632
3Jul 5, 2026 20:544,57547,523,75736,693,0001,284,0002,117,632
4Jul 5, 2026 20:544,58047,587,09036,798,0001,216,0002,117,632
5Jul 5, 2026 20:544,58647,616,83736,811,0001,259,0002,117,632
6Jul 5, 2026 20:544,60447,795,29236,974,0001,246,0002,117,632
7Jul 5, 2026 20:544,63147,976,86937,292,0001,152,0002,117,632
8Jul 5, 2026 20:544,63748,012,12337,343,0001,152,0002,117,632
9Jul 5, 2026 20:544,99850,958,42240,228,0001,261,0002,117,632