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 listDec 15, 2023 13:27matsuoka-601matsuoka-601Score: 7,106Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2023 13:276,93883,611,89257,586,00002,523,136
2Dec 15, 2023 13:276,97885,447,64356,920,000998,0002,404,352
3Dec 15, 2023 13:277,01681,938,87356,225,0002,008,0002,396,160
4Dec 15, 2023 13:277,03079,885,38157,341,0001,005,0002,523,136
5Dec 15, 2023 13:277,03381,073,95157,370,0001,006,0002,523,136
6Dec 15, 2023 13:277,084129,976,38058,800,74502,285,568
7Dec 15, 2023 13:277,10682,729,17256,979,0001,999,0002,523,136
8Dec 15, 2023 13:277,10880,137,99256,998,0001,999,0002,404,352
9Dec 15, 2023 13:277,13283,675,18357,186,0002,006,0002,523,136
10Dec 15, 2023 13:277,167133,102,17559,487,23802,277,376
11Dec 15, 2023 13:277,182133,363,60859,607,08402,285,568
12Dec 15, 2023 13:277,25085,163,83458,171,0002,005,0002,396,160