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 12:47CheckHarryCheckHarryScore: 34,475Success
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 12:4732,415292,542,436267,042,0002,000,0002,281,472
2Feb 20, 2026 12:4732,416295,712,389268,053,0001,000,0002,510,848
3Feb 20, 2026 12:4734,463309,117,656284,045,0002,000,0002,281,472
4Feb 20, 2026 12:4734,470310,071,214283,096,0003,001,0002,510,848
5Feb 20, 2026 12:4734,475314,040,562283,143,0003,001,0002,510,848
6Feb 20, 2026 12:4734,482312,400,507283,202,0003,002,0002,510,848
7Feb 20, 2026 12:4734,486307,280,790284,236,0002,001,0002,514,944
8Feb 20, 2026 12:4734,497320,110,714284,321,0002,002,0002,281,472
9Feb 20, 2026 12:4734,553310,308,379283,789,0002,997,0002,506,752