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 01:59Yuriy LyfenkoYuriy LyfenkoScore: 16,581Success
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 01:5916,549408,551,198137,360,00002,281,472
2Jan 10, 2022 01:5916,555411,963,243136,404,0001,002,0002,281,472
3Jan 10, 2022 01:5916,555414,397,442136,401,0001,002,0002,281,472
4Jan 10, 2022 01:5916,558413,783,281136,432,0001,003,0002,281,472
5Jan 10, 2022 01:5916,562415,817,774136,459,0001,003,0002,269,184
6Jan 10, 2022 01:5916,581418,191,517135,627,0001,994,0002,281,472
7Jan 10, 2022 01:5916,581413,571,695135,629,0001,994,0002,277,376
8Jan 10, 2022 01:5916,582417,675,181135,634,0001,994,0002,281,472
9Jan 10, 2022 01:5916,583411,102,807135,645,0001,994,0002,281,472
10Jan 10, 2022 01:5916,624469,169,094137,981,16802,277,376
11Jan 10, 2022 01:5916,628451,069,326138,011,73302,269,184
12Jan 10, 2022 01:5916,644456,394,276138,144,79802,244,608