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 listFeb 21, 2026 17:07Juraj ZelmanJuraj ZelmanScore: 7,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 17:077,06185,302,36258,607,00002,367,488
2Feb 21, 2026 17:077,06388,692,65858,624,00002,285,568
3Feb 21, 2026 17:077,12184,005,78258,100,0001,001,0002,293,760
4Feb 21, 2026 17:077,14582,840,46257,296,0002,010,0002,355,200
5Feb 21, 2026 17:077,15881,567,89158,402,0001,006,0002,457,600
6Feb 21, 2026 17:077,15987,098,55357,403,0002,014,0002,293,760
7Feb 21, 2026 17:077,16582,975,17258,461,0001,007,0002,293,760
8Feb 21, 2026 17:077,16683,984,24059,479,00002,293,760
9Feb 21, 2026 17:077,17186,078,22259,518,00002,363,392
10Feb 21, 2026 17:077,18487,951,38259,629,00002,293,760
11Feb 21, 2026 17:077,20691,708,13257,816,0001,993,0002,363,392
12Feb 21, 2026 17:077,21389,376,08358,872,000997,0002,293,760