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:03CheckHarryCheckHarryScore: 62,015Success
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:0361,387536,423,885508,510,000999,0002,281,472
2Feb 20, 2026 13:0362,015538,192,841512,727,0001,998,0002,498,560
3Feb 20, 2026 13:0362,034541,546,500512,881,0001,999,0002,510,848