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 30, 2022 15:43Yuriy LyfenkoYuriy LyfenkoScore: 8,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2022 15:437,809132,613,73864,814,86502,265,088
2Jul 30, 2022 15:437,864133,965,18465,272,29002,240,512
3Jul 30, 2022 15:437,866121,803,37865,290,71302,297,856
4Jul 30, 2022 15:437,95995,139,97163,061,0003,002,0002,412,544
5Jul 30, 2022 15:437,98292,435,82464,243,0002,007,0002,322,432
6Jul 30, 2022 15:438,00592,227,66864,432,0002,013,0002,351,104
7Jul 30, 2022 15:438,01494,606,89064,500,0002,015,0002,351,104
8Jul 30, 2022 15:438,01898,126,05063,525,0003,025,0002,510,848
9Jul 30, 2022 15:438,06889,846,06161,970,0004,997,0002,367,488
10Jul 30, 2022 15:438,10094,055,33665,221,0002,006,0002,502,656
11Jul 30, 2022 15:438,10690,242,74265,274,0002,008,0002,400,256
12Jul 30, 2022 15:438,10890,870,47463,282,0004,017,0002,392,064