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 listDec 9, 2024 15:34virusegvirusegScore: 99,022Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2024 15:3498,920855,285,419763,035,00058,002,0002,289,664
2Dec 9, 2024 15:3498,987850,690,109757,628,00063,968,0002,543,616
3Dec 9, 2024 15:3498,993845,185,762760,666,00060,973,0002,535,424
4Dec 9, 2024 15:3498,997848,527,800758,700,00062,975,0002,535,424
5Dec 9, 2024 15:3499,022849,235,569762,894,00058,991,0002,535,424
6Dec 9, 2024 15:3499,023854,249,982764,896,00056,992,0002,535,424
7Dec 9, 2024 15:3499,055847,431,312764,148,00058,011,0002,543,616
8Dec 9, 2024 15:3499,089847,601,526762,480,00059,959,0002,285,568
9Dec 9, 2024 15:3499,122853,131,170765,735,00056,980,0002,293,760