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 11, 2024 20:52Franek KortaFranek KortaScore: 61,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2024 20:5260,86547,281,33122,520,00002,445,312
2Aug 11, 2024 20:5260,90043,530,09522,533,00002,531,328
3Aug 11, 2024 20:5261,10353,218,98722,608,00002,441,216
4Aug 11, 2024 20:5261,13848,469,89021,593,0001,028,0002,527,232
5Aug 11, 2024 20:5261,15947,740,97122,629,00002,445,312
6Aug 11, 2024 20:5261,23851,993,04022,658,00002,437,120
7Aug 11, 2024 20:5261,25148,715,56622,663,00002,445,312
8Aug 11, 2024 20:5261,36548,546,38922,705,00002,269,184
9Aug 11, 2024 20:5261,46251,587,57621,753,000988,0002,265,088
10Aug 11, 2024 20:5265,44099,841,77824,212,74702,174,976
11Aug 11, 2024 20:5265,45187,768,27324,216,76802,301,952
12Aug 11, 2024 20:5265,71687,912,56224,314,79202,170,880