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 30, 2021 14:09Dmitry DolgopolovDmitry DolgopolovError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2021 14:0900000no run stats recorded
2Apr 30, 2021 14:0900000no run stats recorded
3Apr 30, 2021 14:0929,210269,979,546242,439,00002,285,568
4Apr 30, 2021 14:0929,212261,463,739241,458,0001,001,0002,285,568
5Apr 30, 2021 14:0929,220269,280,410241,528,0001,002,0002,285,568
6Apr 30, 2021 14:0929,231266,805,231241,618,0001,002,0002,277,376
7Apr 30, 2021 14:0929,236262,526,960240,661,0001,997,0002,289,664
8Apr 30, 2021 14:0929,246268,966,177240,747,0001,997,0002,523,136
9Apr 30, 2021 14:0929,253269,631,881240,805,0001,998,0002,269,184
10Apr 30, 2021 14:0929,262266,938,992240,875,0001,998,0002,273,280
11Apr 30, 2021 14:0929,278268,951,031241,004,0002,000,0002,265,088