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 listMay 19, 2025 20:29Abhishek ShreeAbhishek ShreeScore: 2,066,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2025 20:292,064,91317,170,832,48417,082,808,00055,973,0002,285,568
2May 19, 2025 20:292,065,45717,174,505,56617,074,317,00068,973,0002,277,376
3May 19, 2025 20:292,065,90417,177,090,73317,069,042,00077,959,0002,265,088
4May 19, 2025 20:292,065,96217,179,855,48117,077,514,00069,973,0002,289,664
5May 19, 2025 20:292,066,58417,188,414,26217,093,670,00058,974,0002,285,568
6May 19, 2025 20:292,068,76417,201,285,60317,109,765,00060,974,0002,265,088
7May 19, 2025 20:292,070,59017,219,609,90917,118,928,00066,972,0002,285,568
8May 19, 2025 20:292,072,31817,227,649,40017,144,265,00055,978,0002,277,376
9May 19, 2025 20:292,072,77717,243,585,80917,140,071,00063,974,0002,519,040