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 02:27CheckHarryCheckHarryScore: 4,471Success
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 02:284,46046,857,76135,989,0001,035,0002,113,536
2Sep 6, 2026 02:284,46146,920,46435,814,0001,213,0002,113,536
3Sep 6, 2026 02:284,46346,923,61635,822,0001,223,0002,113,536
4Sep 6, 2026 02:284,46746,905,09735,841,0001,238,0002,113,536
5Sep 6, 2026 02:284,47147,176,64535,889,0001,221,0002,113,536
6Sep 6, 2026 02:284,48056,236,21636,166,0001,022,0002,113,536
7Sep 6, 2026 02:284,48547,251,57136,204,0001,025,0002,113,536
8Sep 6, 2026 02:284,49247,216,28036,047,0001,242,0002,113,536
9Sep 6, 2026 02:284,57847,874,28836,760,0001,243,0002,113,536