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 12, 2026 18:30CheckHarryCheckHarryScore: 78,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2026 18:3078,596680,157,949651,348,0001,000,0002,281,472
2Feb 12, 2026 18:3078,608683,272,160650,451,0001,998,0002,281,472
3Feb 12, 2026 18:3078,666683,810,168650,932,0001,999,0002,527,232