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 2, 2022 20:21Yuriy LyfenkoYuriy LyfenkoScore: 61,759Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2022 20:2161,524554,061,17122,764,00002,281,472
2Aug 2, 2022 20:2161,530548,529,50020,787,0001,979,0002,281,472
3Aug 2, 2022 20:2161,535547,058,98919,799,0002,969,0002,289,664
4Aug 2, 2022 20:2161,543554,784,93321,781,000990,0002,285,568
5Aug 2, 2022 20:2161,630548,504,27521,812,000991,0002,289,664
6Aug 2, 2022 20:2161,741547,344,48620,858,0001,986,0002,281,472
7Aug 2, 2022 20:2161,759547,686,89020,864,0001,987,0002,281,472
8Aug 2, 2022 20:2161,792545,785,45620,875,0001,988,0002,281,472
9Aug 2, 2022 20:2161,930545,979,12320,922,0001,992,0002,285,568
10Aug 2, 2022 20:2163,960589,740,77823,665,23702,252,800
11Aug 2, 2022 20:2164,088589,052,97423,712,62002,248,704
12Aug 2, 2022 20:2164,164587,511,35623,740,64902,269,184