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:17CheckHarryCheckHarryScore: 51,609Success
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:1751,603459,098,149427,302,0001,000,0002,510,848
2Feb 20, 2026 13:1751,609455,983,889428,354,00002,281,472
3Feb 20, 2026 13:1751,653452,963,484426,722,0001,998,0002,510,848