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 listSep 6, 2026 03:50CheckHarryCheckHarryScore: 3,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:503,85741,981,47630,996,0001,024,0002,113,536
2Sep 6, 2026 03:503,86941,961,56131,105,0001,008,0002,113,536
3Sep 6, 2026 03:503,87242,074,85831,128,0001,016,0002,113,536
4Sep 6, 2026 03:503,88042,078,99331,199,0001,012,0002,113,536
5Sep 6, 2026 03:503,88042,153,54431,165,0001,046,0002,113,536
6Sep 6, 2026 03:503,94542,621,86531,736,0001,012,0002,113,536
7Sep 6, 2026 03:504,03144,436,51632,443,0001,018,0002,113,536
8Sep 6, 2026 03:504,03443,369,40932,463,0001,020,0002,113,536
9Sep 6, 2026 03:504,06143,543,21932,699,0001,015,0002,113,536