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 31, 2022 13:51Yuriy LyfenkoYuriy LyfenkoScore: 7,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2022 13:517,562135,424,71362,764,69102,240,512
2Jul 31, 2022 13:517,611128,425,17663,173,07202,240,512
3Jul 31, 2022 13:517,63091,634,29661,323,0002,010,0002,404,352
4Jul 31, 2022 13:517,65892,040,03861,548,0002,017,0002,334,720
5Jul 31, 2022 13:517,681125,461,17963,753,08302,207,744
6Jul 31, 2022 13:517,68394,149,65061,776,0001,992,0002,433,024
7Jul 31, 2022 13:517,69190,227,27557,850,0005,984,0002,424,832
8Jul 31, 2022 13:517,70193,210,70861,919,0001,997,0002,359,296
9Jul 31, 2022 13:517,74790,888,82859,274,0005,023,0002,486,272
10Jul 31, 2022 13:517,75595,739,13662,356,0002,011,0002,453,504
11Jul 31, 2022 13:517,76586,971,83360,425,0004,028,0002,461,696
12Jul 31, 2022 13:518,38698,144,43865,571,0004,035,0002,289,664