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 18, 2026 17:51Kevin HeaveyKevin HeaveyScore: 3,892Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 18:013,65940,306,49429,327,0001,046,0002,113,536
2Jul 18, 2026 18:013,67940,485,95129,455,0001,086,0002,113,536
3Jul 18, 2026 18:013,68340,349,12029,522,0001,047,0002,113,536
4Jul 18, 2026 18:013,73040,762,99029,916,0001,045,0002,113,536
5Jul 18, 2026 18:013,89242,051,65431,258,0001,048,0002,113,536
6Jul 18, 2026 18:013,93442,426,08531,610,0001,043,0002,113,536
7Jul 18, 2026 18:013,96343,363,30631,849,0001,045,0002,113,536
8Jul 18, 2026 18:013,97043,019,52431,913,0001,042,0002,113,536
9Jul 18, 2026 18:014,00943,683,91032,231,0001,044,0002,113,536