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 listAug 8, 2023 16:39AndreyTSAndreyTSScore: 72,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2023 16:4172,296655,632,016600,057,83002,228,224
2Aug 8, 2023 19:2372,420652,346,984601,083,84002,240,512
3Aug 8, 2023 19:2372,431671,583,759601,181,05802,240,512
4Aug 8, 2023 19:2372,491654,041,485601,676,50302,240,512
5Aug 8, 2023 16:4172,492671,036,208601,680,67402,228,224
6Aug 8, 2023 16:3972,502668,099,748601,768,85202,240,512
7Aug 8, 2023 16:4172,516661,997,398601,882,62702,240,512
8Aug 8, 2023 16:3972,525661,765,629601,955,25302,232,320
9Aug 8, 2023 16:3972,552653,740,906602,184,51202,232,320