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 listAug 6, 2022 19:26Franek KortaFranek KortaScore: 77,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2022 19:2676,61651,316,47724,299,0004,049,0002,281,472
2Aug 6, 2022 19:2676,77657,736,27028,407,00002,523,136
3Aug 6, 2022 19:2676,80556,849,04127,404,0001,014,0002,273,280
4Aug 6, 2022 19:2676,89556,081,71527,435,0001,016,0002,281,472
5Aug 6, 2022 19:2676,92450,891,33025,413,0003,049,0002,273,280
6Aug 6, 2022 19:2677,11649,946,52526,495,0002,038,0002,273,280
7Aug 6, 2022 19:2677,23558,306,41828,577,00002,277,376
8Aug 6, 2022 19:2677,36858,795,86227,604,0001,022,0002,281,472
9Aug 6, 2022 19:2677,44355,759,45927,631,0001,023,0002,281,472
10Aug 6, 2022 19:2681,05184,608,99729,988,97902,289,664
11Aug 6, 2022 19:2681,251105,646,78530,062,79702,260,992
12Aug 6, 2022 19:2681,46890,804,54230,143,15002,260,992