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 02:36CheckHarryCheckHarryScore: 4,249Success
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 02:384,23645,054,53234,145,0001,016,0002,113,536
2Sep 6, 2026 02:384,24145,067,87534,188,0001,013,0002,113,536
3Sep 6, 2026 02:384,24545,076,98434,225,0001,011,0002,113,536
4Sep 6, 2026 02:384,24645,078,60334,235,0001,007,0002,113,536
5Sep 6, 2026 02:384,24945,171,36734,234,0001,037,0002,113,536
6Sep 6, 2026 02:384,25445,252,51234,278,0001,033,0002,113,536
7Sep 6, 2026 02:384,28245,452,05734,521,0001,021,0002,113,536
8Sep 6, 2026 02:384,30645,780,47734,550,0001,192,0002,113,536
9Sep 6, 2026 02:384,41646,574,96835,477,0001,181,0002,113,536