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:33CheckHarryCheckHarryScore: 56,605Success
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:3356,599491,483,919467,772,0001,999,0002,281,472
2Feb 12, 2026 18:3356,605492,053,503468,820,000999,0002,285,568
3Feb 12, 2026 18:3356,622492,386,887467,963,0001,999,0002,281,472