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 16, 2025 18:55Aleksei ShahoikaAleksei ShahoikaScore: 23,313Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2025 18:5523,276218,496,876192,191,0001,000,0002,510,848
2Sep 16, 2025 18:5523,277219,392,050191,195,0002,002,0002,269,184
3Sep 16, 2025 18:5523,290216,540,296192,309,0001,001,0002,285,568
4Sep 16, 2025 18:5523,300218,870,119193,392,00002,265,088
5Sep 16, 2025 18:5523,313226,352,281192,493,0001,002,0002,277,376
6Sep 16, 2025 18:5523,347218,715,602191,787,0001,997,0002,285,568
7Sep 16, 2025 18:5523,413217,005,724193,325,0001,001,0002,265,088
8Sep 16, 2025 18:5523,514220,472,900193,169,0002,001,0002,285,568
9Sep 16, 2025 18:5523,519221,777,412194,204,0001,001,0002,285,568