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 16:26Joad NacerJoad NacerScore: 14,888Success
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 16:2614,106178,798,127117,078,33102,285,568
2Apr 27, 2024 16:2614,563187,244,600120,876,13102,277,376
3Apr 27, 2024 16:2614,671175,765,720121,770,64302,285,568
4Apr 27, 2024 16:2614,882147,819,881122,520,0001,004,0002,285,568
5Apr 27, 2024 16:2614,886153,442,726122,547,0001,004,0002,514,944
6Apr 27, 2024 16:2614,886151,599,901122,550,0001,004,0002,285,568
7Apr 27, 2024 16:2614,888154,275,631122,568,0001,004,0002,285,568
8Apr 27, 2024 16:2614,891148,217,219122,592,0001,004,0002,265,088
9Apr 27, 2024 16:2614,893152,637,032122,609,0001,004,0002,285,568
10Apr 27, 2024 16:2614,898155,079,116122,653,000997,0002,523,136
11Apr 27, 2024 16:2614,914152,948,778121,790,0001,996,0002,285,568
12Apr 27, 2024 16:2615,157149,139,375123,806,0001,996,0002,519,040