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 22, 2023 07:24matsuoka-601matsuoka-601Score: 25,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2023 07:2425,092270,878,497208,263,74502,277,376
2Aug 22, 2023 07:2425,136272,835,096208,625,64402,273,280
3Aug 22, 2023 07:2425,142282,759,150208,679,41502,256,896
4Aug 22, 2023 07:2425,790240,331,852212,061,0002,000,0002,285,568
5Aug 22, 2023 07:2425,802235,583,866212,153,0002,001,0002,285,568
6Aug 22, 2023 07:2425,810236,627,164212,217,0002,002,0002,289,664
7Aug 22, 2023 07:2425,820237,747,535213,303,0001,001,0002,260,992
8Aug 22, 2023 07:2425,829234,807,900212,379,0002,003,0002,285,568
9Aug 22, 2023 07:2425,829237,211,617213,382,0001,001,0002,285,568
10Aug 22, 2023 07:2425,837242,513,874213,448,0001,002,0002,285,568
11Aug 22, 2023 07:2425,845242,292,034213,511,0001,002,0002,519,040
12Aug 22, 2023 07:2425,846242,057,973213,518,0001,002,0002,347,008