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 18, 2026 12:13boop34boop34Score: 9,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 12:149,15185,775,74174,949,0001,006,0002,113,536
2Jul 18, 2026 12:149,15885,662,01175,007,0001,009,0002,113,536
3Jul 18, 2026 12:149,16385,651,57975,052,0001,008,0002,113,536
4Jul 18, 2026 12:149,17185,764,10375,116,0001,006,0002,113,536
5Jul 18, 2026 12:149,17885,874,41175,174,0001,006,0002,113,536
6Jul 18, 2026 12:149,19886,002,21775,313,0001,038,0002,113,536
7Jul 18, 2026 12:149,21586,209,44475,406,0001,080,0002,113,536
8Jul 18, 2026 12:149,43187,921,72177,271,0001,007,0002,113,536
9Jul 18, 2026 12:149,52988,751,25778,088,0001,007,0002,113,536