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,709Success
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,56489,989,11757,801,0004,982,0002,412,544
2Jul 31, 2022 13:517,622138,640,36063,258,99202,207,744
3Jul 31, 2022 13:517,62986,991,97659,297,0004,020,0002,326,528
4Jul 31, 2022 13:517,64889,898,25160,454,0003,022,0002,289,664
5Jul 31, 2022 13:517,663130,943,11563,600,04002,248,704
6Jul 31, 2022 13:517,692158,241,55963,847,03502,244,608
7Jul 31, 2022 13:517,70986,598,16259,984,0003,998,0002,355,200
8Jul 31, 2022 13:517,71191,722,10261,002,0003,000,0002,449,408
9Jul 31, 2022 13:517,77591,088,83860,500,0004,033,0002,338,816
10Jul 31, 2022 13:517,95687,867,64662,031,0004,002,0002,375,680
11Jul 31, 2022 13:5136,2411,793,077,11261,368,000239,436,000253,288,448
12Jul 31, 2022 13:5137,4321,865,851,34261,551,000249,138,000262,807,552