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 listMar 29, 2026 08:17Danylo MocherniukDanylo MocherniukScore: 56,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 08:1756,600491,922,919467,784,0001,999,0002,506,752
2Mar 29, 2026 08:1756,604492,943,640468,818,000999,0002,293,760
3Mar 29, 2026 08:1756,624491,772,430468,981,000999,0002,506,752
4Mar 29, 2026 08:1756,624490,932,230466,983,0002,999,0002,289,664
5Mar 29, 2026 08:1756,628497,455,975468,016,0002,000,0002,293,760
6Mar 29, 2026 08:1756,632499,036,997469,046,0001,000,0002,293,760
7Mar 29, 2026 08:1756,639495,402,539468,102,0002,000,0002,289,664
8Mar 29, 2026 08:1756,639500,776,512469,101,0001,000,0002,293,760
9Mar 29, 2026 08:1756,650498,251,553470,199,00002,506,752