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 listNov 15, 2023 20:48mmalczakmmalczakScore: 69,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2023 20:4868,87042,021,93425,482,00002,535,424
2Nov 15, 2023 20:4869,19746,282,92424,579,0001,024,0002,433,024
3Nov 15, 2023 20:4869,23251,429,86724,592,0001,024,0002,535,424
4Nov 15, 2023 20:4869,27656,255,36025,632,00002,428,928
5Nov 15, 2023 20:4869,41953,980,55724,698,000987,0002,535,424
6Nov 15, 2023 20:4869,46554,348,24724,674,0001,028,0002,273,280
7Nov 15, 2023 20:4869,79251,014,41423,837,0001,986,0002,535,424
8Nov 15, 2023 20:4869,81949,939,54824,840,000993,0002,535,424
9Nov 15, 2023 20:4869,85148,106,70524,851,000994,0002,441,216
10Nov 15, 2023 20:4872,29088,986,68426,747,31602,285,568
11Nov 15, 2023 20:4872,70781,376,21626,901,74702,285,568
12Nov 15, 2023 20:4872,72996,632,74326,909,61002,277,376