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 3, 2026 22:14Josu San MartinJosu San MartinScore: 13,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 22:1413,301119,822,090109,368,0001,037,0002,113,536
2Jul 3, 2026 22:1413,330120,037,917109,598,0001,043,0002,113,536
3Jul 3, 2026 22:1413,352120,153,785109,762,0001,065,0002,113,536
4Jul 3, 2026 22:1413,353120,251,906109,811,0001,027,0002,113,536
5Jul 3, 2026 22:1413,356120,196,153109,818,0001,043,0002,113,536
6Jul 3, 2026 22:1413,357120,237,942109,823,0001,045,0002,113,536
7Jul 3, 2026 22:1413,357120,238,165109,822,0001,049,0002,113,536
8Jul 3, 2026 22:1413,358120,264,061109,828,0001,050,0002,113,536
9Jul 3, 2026 22:1413,379121,872,907109,836,0001,211,0002,113,536