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 16:47Franek KortaFranek KortaScore: 72,573Success
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 16:4769,95154,099,95122,896,0002,986,0002,441,216
2Apr 9, 2023 16:4770,06547,360,28224,927,000997,0002,433,024
3Apr 9, 2023 16:4771,31947,601,66426,388,00002,269,184
4Apr 9, 2023 16:4771,71646,432,69826,535,00002,269,184
5Apr 9, 2023 16:4771,81151,661,56124,527,0002,043,0002,437,120
6Apr 9, 2023 16:4771,85453,055,78626,586,00002,441,216
7Apr 9, 2023 16:4772,57353,208,69726,852,00002,531,328
8Apr 9, 2023 16:4772,58454,374,15525,862,000994,0002,437,120
9Apr 9, 2023 16:4773,51147,104,58626,192,0001,007,0002,531,328
10Apr 9, 2023 16:4778,90189,616,49129,193,48502,179,072
11Apr 9, 2023 16:4779,46893,968,16029,403,25102,179,072
12Apr 9, 2023 16:4779,60283,022,37629,452,89602,170,880