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 12, 2026 14:47boop34boop34Score: 23,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 14:4723,640205,910,436195,205,0001,011,0002,113,536
2Jul 12, 2026 14:4723,659207,348,935195,366,0001,010,0002,113,536
3Jul 12, 2026 14:4723,665206,754,077194,371,0002,056,0002,113,536
4Jul 12, 2026 14:4723,669206,184,304195,448,0001,010,0002,113,536
5Jul 12, 2026 14:4723,670206,101,962195,455,0001,010,0002,113,536
6Jul 12, 2026 14:4723,678206,868,059194,513,0002,022,0002,113,536
7Jul 12, 2026 14:4723,678206,856,468194,513,0002,022,0002,113,536
8Jul 12, 2026 14:4723,720215,570,812194,868,0002,016,0002,113,536
9Jul 12, 2026 14:4723,747215,330,762195,036,0002,070,0002,113,536