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 7, 2024 15:59Matt StuchlikMatt StuchlikScore: 29,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 7, 2024 15:5929,879270,142,339246,996,000999,0002,285,568
2Apr 7, 2024 15:5929,880272,595,092246,008,0002,000,0002,277,376
3Apr 7, 2024 15:5929,881272,475,627246,011,0002,000,0002,277,376
4Apr 7, 2024 15:5929,884273,838,309247,039,0001,000,0002,285,568
5Apr 7, 2024 15:5929,886271,894,038246,050,0002,000,0002,285,568
6Apr 7, 2024 15:5929,887280,048,176246,064,0002,000,0002,285,568
7Apr 7, 2024 15:5929,901269,497,025246,179,0002,001,0002,285,568
8Apr 7, 2024 15:5929,903307,982,928248,192,45402,293,760
9Apr 7, 2024 15:5929,904305,187,113248,202,24302,289,664
10Apr 7, 2024 15:5929,911275,270,061247,260,0001,001,0002,387,968
11Apr 7, 2024 15:5929,915313,108,162248,292,24202,293,760
12Apr 7, 2024 15:5932,803291,599,750270,266,0002,001,0002,277,376