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 listOct 24, 2026 15:45timothygktimothygkScore: 8,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 15:508,36380,924,97758,908,00010,511,0002,117,632stderr
2Oct 24, 2026 15:508,37680,579,12059,142,00010,386,0002,117,632stderr
3Oct 24, 2026 15:508,55382,427,68760,271,00010,720,0002,117,632stderr
4Oct 24, 2026 15:508,56082,580,18460,052,00011,000,0002,117,632stderr
5Oct 24, 2026 15:508,57182,562,83660,143,00010,998,0002,117,632stderr
6Oct 24, 2026 15:508,57282,667,57460,791,00010,357,0002,117,632stderr
7Oct 24, 2026 15:508,60582,946,51760,604,00010,821,0002,117,632stderr
8Oct 24, 2026 15:508,97585,483,49763,845,00010,654,0002,117,632stderr
9Oct 24, 2026 15:509,21687,570,42365,445,00011,049,0002,117,632stderr