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:10CheckHarryCheckHarryScore: 25,633Success
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:1025,608241,615,950211,542,0001,002,0002,506,752
2Feb 20, 2026 13:1025,611236,844,669211,568,0001,002,0002,281,472
3Feb 20, 2026 13:1025,612240,283,112210,578,0002,005,0002,506,752
4Feb 20, 2026 13:1025,631240,974,336211,742,000998,0002,281,472
5Feb 20, 2026 13:1025,633242,258,157211,753,000998,0002,281,472
6Feb 20, 2026 13:1025,635237,356,079210,777,0001,997,0002,281,472
7Feb 20, 2026 13:1025,636238,067,104211,782,000998,0002,351,104
8Feb 20, 2026 13:1025,645237,200,619209,854,0002,997,0002,281,472
9Feb 20, 2026 13:1025,654234,890,964210,933,0001,999,0002,281,472