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 17, 2026 01:04Kevin HeaveyKevin HeaveyScore: 3,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 01:093,74240,845,88530,013,0001,052,0002,113,536
2Jul 17, 2026 01:093,74440,959,48329,995,0001,086,0002,113,536
3Jul 17, 2026 01:093,76440,989,48630,200,0001,049,0002,113,536
4Jul 17, 2026 01:093,78341,259,89730,355,0001,047,0002,113,536
5Jul 17, 2026 01:093,80941,354,17630,589,0001,027,0002,113,536
6Jul 17, 2026 01:093,96343,913,30431,849,0001,047,0002,113,536
7Jul 17, 2026 01:093,99842,912,90232,163,0001,023,0002,113,536
8Jul 17, 2026 01:094,05743,485,15232,625,0001,049,0002,113,536
9Jul 17, 2026 01:094,12244,107,28433,172,0001,046,0002,113,536