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 listNov 8, 2024 13:36u130b8u130b8Score: 1,828,391Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2024 13:361,824,36915,177,011,26215,073,291,00068,969,0002,281,472
2Nov 8, 2024 13:361,825,62915,188,958,47315,090,749,00061,970,0002,281,472
3Nov 8, 2024 13:361,826,49515,189,319,68615,084,938,00074,969,0002,281,472
4Nov 8, 2024 13:361,826,77615,193,171,01115,097,272,00064,971,0002,281,472
5Nov 8, 2024 13:361,828,39115,211,952,15515,108,666,00066,976,0002,265,088
6Nov 8, 2024 13:361,830,44315,221,282,55415,126,701,00065,972,0002,281,472
7Nov 8, 2024 13:361,836,32615,274,007,56115,170,529,00070,974,0002,293,760
8Nov 8, 2024 13:361,836,35815,274,499,70315,169,798,00071,970,0002,281,472
9Nov 8, 2024 13:361,864,09915,503,494,79515,403,046,00068,973,0002,281,472