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 listApr 26, 2024 21:20Joad NacerJoad NacerScore: 29,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2024 21:2029,244308,433,008242,727,64902,285,568
2Apr 26, 2024 21:2029,300308,856,927243,192,30302,285,568
3Apr 26, 2024 21:2029,509305,625,605244,924,59702,277,376
4Apr 26, 2024 21:2029,800273,137,648246,335,0001,001,0002,265,088
5Apr 26, 2024 21:2029,809277,521,875246,413,0001,001,0002,285,568
6Apr 26, 2024 21:2029,823273,904,321247,532,00002,383,872
7Apr 26, 2024 21:2029,834272,801,663246,624,0001,002,0002,285,568
8Apr 26, 2024 21:2029,846278,321,772246,723,000998,0002,285,568
9Apr 26, 2024 21:2029,857270,772,888245,818,0001,998,0002,523,136
10Apr 26, 2024 21:2029,860274,170,039246,837,000999,0002,285,568
11Apr 26, 2024 21:2029,890271,868,648246,090,0002,000,0002,260,992
12Apr 26, 2024 21:2029,904275,409,330246,205,0002,001,0002,285,568