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 20, 2025 08:13sheryllynn24sheryllynn24Score: 10,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 08:1310,660108,872,49087,471,0001,005,0002,285,568
2Sep 20, 2025 08:1310,666111,511,96586,518,0002,012,0002,510,848
3Sep 20, 2025 08:1310,670112,914,46588,560,00002,285,568
4Sep 20, 2025 08:1310,671116,302,29787,566,0001,006,0002,285,568
5Sep 20, 2025 08:1310,779119,755,96788,464,0001,005,0002,260,992
6Sep 20, 2025 08:1310,782109,633,72288,487,0001,005,0002,273,280
7Sep 20, 2025 08:1310,785117,653,70287,505,0002,011,0002,265,088
8Sep 20, 2025 08:1310,802115,456,41288,651,0001,007,0002,281,472
9Sep 20, 2025 08:1310,805116,577,14087,692,0001,993,0002,347,008
10Sep 20, 2025 08:1310,820115,239,05087,814,0001,995,0002,519,040
11Sep 20, 2025 08:1310,842114,706,30187,993,0001,999,0002,285,568
12Sep 20, 2025 08:1311,019113,664,85890,451,0001,005,0002,256,896