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 3, 2024 10:27Aleksey RopanAleksey RopanScore: 487,924Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2024 10:28487,3484,125,643,4574,044,991,91302,240,512
2May 3, 2024 10:28487,3564,134,335,3334,045,052,76002,228,224
3May 3, 2024 10:27487,6034,088,772,9984,047,106,44102,240,512
4May 3, 2024 10:28487,9244,104,733,2344,049,768,51202,256,896
5May 3, 2024 10:27498,9484,213,184,6324,141,271,77702,252,800
6May 3, 2024 10:27505,9684,269,266,8254,199,535,48202,244,608