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 listJul 15, 2022 04:09Robert BurkeRobert BurkeScore: 8,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2022 04:098,25094,073,35368,476,00002,514,944
2Jul 15, 2022 04:098,25185,406,32868,486,00002,412,544
3Jul 15, 2022 04:098,25489,886,24668,510,00002,400,256
4Jul 15, 2022 04:098,26193,934,89467,559,0001,008,0002,408,448
5Jul 15, 2022 04:098,26393,190,35368,579,00002,498,560
6Jul 15, 2022 04:098,26394,527,36168,579,00002,404,352
7Jul 15, 2022 04:098,26391,365,65068,581,00002,412,544
8Jul 15, 2022 04:098,26895,534,26467,612,0001,009,0002,408,448
9Jul 15, 2022 04:098,26891,603,96468,625,00002,510,848
10Jul 15, 2022 04:098,937125,734,59274,176,30302,277,376
11Jul 15, 2022 04:098,940127,547,99574,205,93602,289,664
12Jul 15, 2022 04:098,942127,025,37374,219,37802,281,472