TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listApr 9, 2023 21:24Franek KortaFranek KortaScore: 98,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 21:2495,50859,289,67433,319,0002,019,0002,441,216
2Apr 9, 2023 21:2495,98656,725,36034,501,0001,014,0002,527,232
3Apr 9, 2023 21:2497,40356,777,85735,038,0001,001,0002,433,024
4Apr 9, 2023 21:2497,705102,524,52336,150,67102,301,952
5Apr 9, 2023 21:2497,77062,116,16735,171,0001,004,0002,437,120
6Apr 9, 2023 21:2497,90858,914,21435,220,0001,006,0002,269,184
7Apr 9, 2023 21:2498,03896,171,55536,274,17502,248,704
8Apr 9, 2023 21:2498,26258,797,72934,338,0002,019,0002,269,184
9Apr 9, 2023 21:2498,68399,434,95436,512,76702,293,760
10Apr 9, 2023 21:2499,54360,745,98635,836,000995,0002,527,232
11Apr 9, 2023 21:24100,41461,370,86235,145,0002,008,0002,420,736
12Apr 9, 2023 21:24104,07858,339,93636,483,0002,026,0002,514,944