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 04:00CheckHarryCheckHarryScore: 3,855Success
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 04:013,83141,691,62030,792,0001,008,0002,113,536
2Sep 6, 2026 04:013,83641,677,66930,825,0001,016,0002,113,536
3Sep 6, 2026 04:013,83741,737,52330,838,0001,017,0002,113,536
4Sep 6, 2026 04:013,84941,758,99430,937,0001,010,0002,113,536
5Sep 6, 2026 04:013,85541,848,44930,983,0001,015,0002,113,536
6Sep 6, 2026 04:013,88342,133,79131,224,0001,009,0002,113,536
7Sep 6, 2026 04:013,89642,303,93331,201,0001,137,0002,113,536
8Sep 6, 2026 04:013,89942,664,02531,339,0001,027,0002,113,536
9Sep 6, 2026 04:014,00743,094,89832,218,0001,042,0002,113,536