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 listSep 5, 2023 07:34mmalczakmmalczakScore: 47,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2023 21:2047,744465,202,220396,271,97902,285,568
2Sep 4, 2023 21:2047,759455,600,698396,396,46702,273,280
3Sep 5, 2023 07:2747,784459,952,131396,605,23302,289,664
4Sep 4, 2023 21:2047,789473,646,734396,649,04802,273,280
5Sep 5, 2023 07:3447,790471,769,711396,655,67902,289,664
6Sep 5, 2023 07:2847,792461,543,834396,669,70002,277,376
7Sep 5, 2023 07:2847,801461,501,190396,748,36102,281,472
8Sep 5, 2023 07:2747,803455,483,175396,766,25902,285,568
9Sep 5, 2023 07:2747,819464,400,788396,896,49602,289,664
10Sep 5, 2023 07:3447,822455,603,067396,921,91202,277,376
11Sep 5, 2023 07:3447,884469,916,780397,436,57002,285,568
12Sep 5, 2023 07:2847,891466,302,555397,495,08002,281,472