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 15, 2023 12:45Kevin HeaveyKevin HeaveyScore: 52,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2023 12:5252,527503,494,375435,973,75602,224,128
2Jan 15, 2023 12:4552,529507,371,775435,992,27602,211,840
3Jan 15, 2023 12:5252,534511,625,844436,036,25102,232,320
4Jan 12, 2023 12:3852,543503,058,724436,106,87802,228,224
5Jan 15, 2023 17:3052,546494,665,409436,129,94102,228,224
6Jan 15, 2023 12:5252,547501,031,163436,138,07202,224,128
7Jan 15, 2023 17:3052,549501,316,415436,152,78302,236,416
8Jan 15, 2023 17:3052,551488,389,494436,172,77902,236,416
9Jan 12, 2023 12:3852,556522,960,473436,210,93602,224,128
10Jan 12, 2023 12:3852,564498,904,992436,284,70802,224,128
11Jan 15, 2023 12:4552,577501,564,818436,386,43002,232,320
12Jan 15, 2023 12:4552,582495,837,356436,427,00402,236,416