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 listSep 6, 2026 08:04CheckHarryCheckHarryScore: 3,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 08:053,84241,812,19630,880,0001,015,0002,113,536
2Sep 6, 2026 08:053,84341,668,52730,889,0001,010,0002,113,536
3Sep 6, 2026 08:053,84941,751,33930,922,0001,028,0002,113,536
4Sep 6, 2026 08:053,85241,853,47130,918,0001,055,0002,113,536
5Sep 6, 2026 08:053,85341,811,34730,968,0001,019,0002,113,536
6Sep 6, 2026 08:053,85541,875,42630,982,0001,019,0002,113,536
7Sep 6, 2026 08:053,86642,083,00030,918,0001,176,0002,113,536
8Sep 6, 2026 08:053,88742,146,50631,247,0001,019,0002,113,536
9Sep 6, 2026 08:053,91842,429,54531,498,0001,025,0002,113,536