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 3, 2026 14:22CheckHarryCheckHarryScore: 4,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 14:234,24245,152,71634,192,0001,017,0002,113,536
2Sep 3, 2026 14:234,26045,179,27334,342,0001,017,0002,113,536
3Sep 3, 2026 14:234,27045,368,36034,423,0001,019,0002,113,536
4Sep 3, 2026 14:234,27245,352,83834,445,0001,017,0002,113,536
5Sep 3, 2026 14:234,29945,627,70334,668,0001,017,0002,113,536
6Sep 3, 2026 14:234,31045,663,73234,707,0001,068,0002,113,536
7Sep 3, 2026 14:234,36047,026,75735,171,0001,018,0002,113,536
8Sep 3, 2026 14:234,41546,602,37435,631,0001,017,0002,113,536
9Sep 3, 2026 14:234,45547,589,28035,964,0001,015,0002,113,536