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 listMay 15, 2026 11:14Victor MerckléVictor MerckléScore: 6,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 11:146,96166,866,82557,784,00002,113,536
2May 15, 2026 11:146,96466,710,76957,807,00002,113,536
3May 15, 2026 11:146,96465,705,91257,803,00002,113,536
4May 15, 2026 11:146,96565,103,97757,816,00002,113,536
5May 15, 2026 11:146,96765,082,77757,829,00002,113,536
6May 15, 2026 11:146,96865,242,08457,841,00002,113,536
7May 15, 2026 11:146,97065,167,09456,811,0001,040,0002,113,536
8May 15, 2026 11:146,97466,459,06556,843,0001,048,0002,113,536
9May 15, 2026 11:147,01867,485,03258,255,00002,113,536