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 14:29timothygktimothygkScore: 9,305Success
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 14:309,16987,075,54164,671,00011,439,0002,125,824stderr
2Oct 24, 2026 14:309,20887,449,77065,021,00011,412,0002,125,824stderr
3Oct 24, 2026 14:309,27887,917,49165,415,00011,600,0002,125,824stderr
4Oct 24, 2026 14:309,29888,142,78065,402,00011,779,0002,125,824stderr
5Oct 24, 2026 14:309,30588,660,60165,158,00012,080,0002,125,824stderr
6Oct 24, 2026 14:309,31288,280,13065,756,00011,537,0002,125,824stderr
7Oct 24, 2026 14:309,34190,539,72365,937,00011,595,0002,121,728stderr
8Oct 24, 2026 14:309,35288,789,70966,569,00011,059,0002,125,824stderr
9Oct 24, 2026 14:3011,009102,403,29480,315,00011,067,0002,125,824stderr