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 21, 2026 15:19Kevin HeaveyKevin HeaveyScore: 3,805Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 15:223,60439,834,51428,871,0001,048,0002,113,536
2Jul 21, 2026 15:223,62139,886,20229,010,0001,049,0002,113,536
3Jul 21, 2026 15:223,62639,908,07329,047,0001,050,0002,113,536
4Jul 21, 2026 15:223,67340,386,63029,440,0001,046,0002,113,536
5Jul 21, 2026 15:223,80541,457,58530,548,0001,037,0002,113,536
6Jul 21, 2026 15:223,82441,643,92530,700,0001,043,0002,113,536
7Jul 21, 2026 15:223,84742,414,84630,902,0001,032,0002,113,536
8Jul 21, 2026 15:223,89043,107,16531,245,0001,048,0002,113,536
9Jul 21, 2026 15:223,91642,922,74931,473,0001,034,0002,113,536