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 19, 2022 01:36Yuriy LyfenkoYuriy LyfenkoScore: 7,389Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2022 01:367,21882,033,99056,911,0002,995,0002,359,296
2Sep 19, 2022 01:367,25189,155,27357,178,0003,009,0002,473,984
3Sep 19, 2022 01:367,27288,127,52256,331,0004,023,0002,277,376
4Sep 19, 2022 01:367,28183,330,08857,415,0003,021,0002,408,448
5Sep 19, 2022 01:367,38090,134,56960,248,0001,004,0002,428,928
6Sep 19, 2022 01:367,38883,055,83858,306,0003,015,0002,326,528
7Sep 19, 2022 01:367,38986,070,02856,303,0005,027,0002,486,272
8Sep 19, 2022 01:367,41185,814,46158,489,0003,025,0002,490,368
9Sep 19, 2022 01:367,45986,258,50758,917,0002,995,0002,293,760
10Sep 19, 2022 01:367,507123,016,96862,305,78602,187,264
11Sep 19, 2022 01:367,562131,119,57962,763,65202,277,376
12Sep 19, 2022 01:367,566143,217,75162,796,14202,224,128