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 20, 2026 13:45CheckHarryCheckHarryScore: 20,214Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 13:4520,027190,244,302165,220,0001,001,0002,506,752
2Feb 20, 2026 13:4520,091193,015,112165,761,000998,0002,510,848
3Feb 20, 2026 13:4520,208189,810,244164,731,0002,995,0002,281,472
4Feb 20, 2026 13:4520,211190,629,698165,757,0001,997,0002,281,472
5Feb 20, 2026 13:4520,214198,036,381165,780,0001,997,0002,281,472
6Feb 20, 2026 13:4520,233194,154,818165,931,0001,999,0002,510,848
7Feb 20, 2026 13:4520,248193,248,373166,060,0002,000,0002,281,472
8Feb 20, 2026 13:4520,249198,257,269166,069,0002,000,0002,502,656
9Feb 20, 2026 13:4520,268193,854,665167,232,000995,0002,281,472