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 18, 2026 09:43CheckHarryCheckHarryScore: 44,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 09:4344,178394,224,258365,676,000999,0002,367,488
2Feb 18, 2026 09:4344,520397,293,973368,515,000998,0002,347,008
3Feb 18, 2026 09:4344,582396,724,973368,027,0002,000,0002,359,296
4Feb 18, 2026 09:4344,605401,733,007370,218,00002,355,200
5Feb 18, 2026 09:4344,617395,986,974368,318,0002,001,0002,359,296
6Feb 18, 2026 09:4344,625399,249,951370,388,00002,355,200
7Feb 18, 2026 09:4344,654400,163,429369,629,000998,0002,359,296
8Feb 18, 2026 09:4344,655405,195,507368,641,0001,998,0002,367,488
9Feb 18, 2026 09:4344,680401,120,406368,845,0001,999,0002,351,104