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 listJan 10, 2022 07:53Yuriy LyfenkoYuriy LyfenkoScore: 11,513Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2022 07:5311,492119,262,74394,376,0001,004,0002,289,664
2Jan 10, 2022 07:5311,497119,716,31794,417,0001,004,0002,277,376
3Jan 10, 2022 07:5311,497115,742,02594,417,0001,004,0002,281,472
4Jan 10, 2022 07:5311,501115,515,07095,461,00002,383,872
5Jan 10, 2022 07:5311,505123,142,50495,493,00002,289,664
6Jan 10, 2022 07:5311,506122,052,77994,493,0001,005,0002,289,664
7Jan 10, 2022 07:5311,513127,565,27494,549,0001,005,0002,289,664
8Jan 10, 2022 07:5311,760123,930,06296,606,0001,006,0002,289,664
9Jan 10, 2022 07:5311,781126,655,55096,787,000997,0002,289,664
10Jan 10, 2022 07:5312,263157,630,866101,782,53402,265,088
11Jan 10, 2022 07:5312,277159,583,285101,897,84802,260,992
12Jan 10, 2022 07:5312,281161,407,761101,929,66802,277,376