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 14, 2026 13:17Juraj ZelmanJuraj ZelmanScore: 36,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 13:1736,464332,947,118300,658,0001,997,0002,293,760
2Feb 14, 2026 13:1736,464331,692,926300,653,0001,997,0002,371,584
3Feb 14, 2026 13:1736,468331,327,631301,684,000998,0002,293,760
4Feb 14, 2026 13:1736,470334,854,200300,707,0001,998,0002,363,392
5Feb 14, 2026 13:1736,471330,732,408300,708,0001,998,0002,293,760
6Feb 14, 2026 13:1736,472329,679,808302,716,00002,289,664
7Feb 14, 2026 13:1736,479328,995,688300,780,0001,998,0002,293,760
8Feb 14, 2026 13:1736,489329,629,094300,857,0001,999,0002,293,760
9Feb 14, 2026 13:1736,502325,626,331301,971,000999,0002,289,664