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 15, 2026 01:57Kevin HeaveyKevin HeaveyScore: 3,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 01:593,70240,405,59229,474,0001,256,0002,117,632
2Jul 15, 2026 01:593,70940,438,81929,526,0001,264,0002,117,632
3Jul 15, 2026 01:593,71640,499,45329,561,0001,288,0002,117,632
4Jul 15, 2026 01:593,71740,450,49629,822,0001,030,0002,117,632
5Jul 15, 2026 01:593,72740,551,88229,676,0001,262,0002,117,632
6Jul 15, 2026 01:593,72840,578,75529,662,0001,284,0002,117,632
7Jul 15, 2026 01:593,73840,716,50829,753,0001,278,0002,117,632
8Jul 15, 2026 01:593,78141,058,02830,370,0001,020,0002,117,632
9Jul 15, 2026 01:593,80041,069,13230,500,0001,043,0002,117,632