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 27, 2024 22:37Joad NacerJoad NacerScore: 9,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 22:378,870128,370,07173,618,26302,277,376
2Apr 27, 2024 22:378,880124,779,33173,703,12102,273,280
3Apr 27, 2024 22:379,001140,884,66074,705,50702,277,376
4Apr 27, 2024 22:379,792110,957,05981,277,00002,273,280
5Apr 27, 2024 22:379,795106,221,49179,293,0002,007,0002,273,280
6Apr 27, 2024 22:379,796107,698,36479,298,0002,007,0002,285,568
7Apr 27, 2024 22:379,826107,995,65280,551,0001,006,0002,285,568
8Apr 27, 2024 22:379,854108,204,76680,792,000997,0002,285,568
9Apr 27, 2024 22:379,857111,406,62780,812,000997,0002,285,568
10Apr 27, 2024 22:379,862111,481,94779,861,0001,996,0002,277,376
11Apr 27, 2024 22:379,975112,507,93980,796,0001,994,0002,281,472
12Apr 27, 2024 22:3710,128113,147,73482,059,0002,001,0002,265,088