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 21:56Joad NacerJoad NacerScore: 12,304Success
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 21:5612,136161,872,369100,729,03302,265,088
2Apr 27, 2024 21:5612,146171,343,129100,811,82502,277,376
3Apr 27, 2024 21:5612,189158,137,028101,169,36802,277,376
4Apr 27, 2024 21:5612,290129,812,617101,008,0001,000,0002,510,848
5Apr 27, 2024 21:5612,293127,887,148100,031,0002,000,0002,285,568
6Apr 27, 2024 21:5612,298127,565,338100,075,0002,001,0002,285,568
7Apr 27, 2024 21:5612,304128,522,653100,124,0002,002,0002,285,568
8Apr 27, 2024 21:5612,305131,791,691102,131,00002,514,944
9Apr 27, 2024 21:5612,313123,709,047100,195,0002,003,0002,514,944
10Apr 27, 2024 21:5612,399126,576,776100,913,0001,998,0002,510,848
11Apr 27, 2024 21:5612,729131,716,588104,644,0001,006,0002,277,376
12Apr 27, 2024 21:5613,234140,458,709108,842,000998,0002,510,848