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 22, 2026 13:40SneedSneedScore: 62,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 13:4062,363553,371,365456,659,00060,954,0002,281,472
2Feb 22, 2026 13:4062,369542,690,938446,712,00070,954,0002,289,664
3Feb 22, 2026 13:4062,424544,319,781450,103,00068,015,0002,281,472
4Feb 22, 2026 13:4062,427543,687,950440,124,00078,022,0002,514,944
5Feb 22, 2026 13:4062,433543,199,568442,165,00076,028,0002,371,584
6Feb 22, 2026 13:4062,463555,562,679451,385,00067,057,0002,265,088
7Feb 22, 2026 13:4062,565542,483,827472,265,00047,026,0002,265,088
8Feb 22, 2026 13:4062,628543,993,859456,835,00062,977,0002,293,760
9Feb 22, 2026 13:4062,721549,874,412452,638,00067,945,0002,281,472