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 14, 2026 17:29CheckHarryCheckHarryScore: 60,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 17:2960,829528,267,538503,880,000999,0002,285,568
2Feb 14, 2026 17:2960,913536,274,009505,574,00002,285,568
3Feb 14, 2026 17:2961,908547,045,244512,841,000999,0002,285,568