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:43Franek KortaFranek KortaScore: 83,984Success
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:4381,95952,291,46228,304,0002,021,0002,527,232
2Aug 6, 2022 19:4382,09553,928,81729,363,0001,012,0002,281,472
3Aug 6, 2022 19:4382,37852,248,32729,464,0001,016,0002,514,944
4Aug 6, 2022 19:4383,47358,798,11428,893,0001,992,0002,281,472
5Aug 6, 2022 19:4383,61156,584,32929,939,000997,0002,281,472
6Aug 6, 2022 19:4383,69552,946,95128,970,0001,997,0002,523,136
7Aug 6, 2022 19:4383,98454,707,42328,067,0003,007,0002,527,232
8Aug 6, 2022 19:4384,84159,747,81929,366,0002,025,0002,285,568
9Aug 6, 2022 19:4385,46257,453,09630,601,0001,020,0002,273,280
10Aug 6, 2022 19:4386,23499,970,73931,906,60002,269,184
11Aug 6, 2022 19:4388,48489,972,04532,738,96802,260,992
12Aug 6, 2022 19:4389,36199,969,40333,063,44202,256,896