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 listSep 15, 2021 17:54Yuriy LyfenkoYuriy LyfenkoScore: 61,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2021 17:5461,124548,679,95822,616,00002,277,376
2Sep 15, 2021 17:5461,151551,140,90722,626,00002,281,472
3Sep 15, 2021 17:5461,497550,321,96321,765,000989,0002,281,472
4Sep 15, 2021 17:5461,505549,407,29821,768,000989,0002,281,472
5Sep 15, 2021 17:5461,505549,836,84622,757,00002,281,472
6Sep 15, 2021 17:5461,516553,418,42221,772,000989,0002,289,664
7Sep 15, 2021 17:5461,541553,343,13120,790,0001,980,0002,281,472
8Sep 15, 2021 17:5461,584548,657,03921,796,000990,0002,531,328
9Sep 15, 2021 17:5461,765544,019,58720,866,0001,987,0002,289,664
10Sep 15, 2021 17:5464,634591,255,20323,914,49802,252,800
11Sep 15, 2021 17:5464,678589,333,84423,930,84202,248,704
12Sep 15, 2021 17:5464,752600,372,78023,958,36002,252,800