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 23:03Kevin HeaveyKevin HeaveyScore: 3,761Success
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 23:083,70540,495,47229,706,0001,049,0002,113,536
2Jul 16, 2026 23:083,73248,951,90229,931,0001,049,0002,113,536
3Jul 16, 2026 23:083,73540,803,40729,954,0001,051,0002,113,536
4Jul 16, 2026 23:083,75440,969,75930,037,0001,129,0002,113,536
5Jul 16, 2026 23:083,76140,982,53630,192,0001,026,0002,113,536
6Jul 16, 2026 23:083,76342,131,33430,187,0001,050,0002,113,536
7Jul 16, 2026 23:083,78041,100,58830,325,0001,051,0002,113,536
8Jul 16, 2026 23:083,79841,270,41230,479,0001,049,0002,113,536
9Jul 16, 2026 23:084,01043,042,80232,238,0001,045,0002,113,536