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 listDec 15, 2023 12:46Dmitrii VasilevDmitrii VasilevScore: 64,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2023 12:4664,763592,760,531537,531,38502,256,896
2Dec 15, 2023 19:4564,767600,134,186537,566,26902,191,360
3Dec 15, 2023 19:4564,770596,330,948537,594,13302,195,456
4Dec 15, 2023 12:4464,772599,423,905537,604,08002,187,264
5Dec 15, 2023 12:4464,784596,393,659537,706,78102,199,552
6Dec 15, 2023 12:4464,785601,504,556537,716,85602,199,552
7Dec 15, 2023 12:4664,797591,165,328537,812,83402,191,360
8Dec 15, 2023 12:4664,860607,376,660538,341,33602,195,456
9Dec 15, 2023 19:4564,933615,191,731538,940,14302,195,456