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: 77,391Success
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:3077,363666,422,789641,109,0001,000,0002,523,136
2Feb 12, 2026 18:3077,391674,127,590641,345,000998,0002,281,472
3Feb 12, 2026 18:3077,396670,142,113639,387,0002,997,0002,281,472