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 16, 2026 22:52Kevin HeaveyKevin HeaveyScore: 3,781Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 22:573,73840,792,07229,980,0001,050,0002,113,536
2Jul 16, 2026 22:573,75440,934,66730,138,0001,027,0002,113,536
3Jul 16, 2026 22:573,77941,106,07730,325,0001,048,0002,113,536
4Jul 16, 2026 22:573,78041,133,89230,333,0001,048,0002,113,536
5Jul 16, 2026 22:573,78141,402,08730,333,0001,053,0002,113,536
6Jul 16, 2026 22:573,79641,295,51130,461,0001,048,0002,113,536
7Jul 16, 2026 22:573,81541,396,77630,625,0001,047,0002,113,536
8Jul 16, 2026 22:573,84241,648,75230,842,0001,047,0002,113,536
9Jul 16, 2026 22:573,87441,939,84431,018,0001,140,0002,113,536