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 14, 2026 07:09Victor MerckléVictor MerckléScore: 6,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 07:096,96067,270,65556,768,0001,006,0002,113,536
2May 14, 2026 07:096,96365,118,60956,787,0001,008,0002,113,536
3May 14, 2026 07:096,96465,431,57557,806,00002,113,536
4May 14, 2026 07:096,96765,338,54956,824,0001,008,0002,113,536
5May 14, 2026 07:096,97370,165,45657,878,00002,113,536
6May 14, 2026 07:097,01767,475,72357,226,0001,019,0002,113,536
7May 14, 2026 07:097,03266,645,36057,338,0001,030,0002,113,536
8May 14, 2026 07:097,08167,730,15657,765,0001,009,0002,113,536
9May 14, 2026 07:097,08667,799,54857,790,0001,029,0002,113,536