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 listDec 3, 2024 17:59spacecat8086spacecat8086Score: 113,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 3, 2024 17:59112,63069,035,45140,657,0001,016,0002,277,376
2Dec 3, 2024 17:59113,09270,225,93639,852,0001,992,0002,285,568
3Dec 3, 2024 17:59113,11466,416,43940,856,000996,0002,527,232
4Dec 3, 2024 17:59113,20567,209,75439,892,0001,994,0002,277,376
5Dec 3, 2024 17:59113,87865,580,41740,129,0002,006,0002,531,328
6Dec 3, 2024 17:59114,05465,764,06840,191,0002,009,0002,273,280
7Dec 3, 2024 17:59114,11464,413,90640,212,0002,010,0002,285,568
8Dec 3, 2024 17:59114,13264,778,81841,224,0001,005,0002,269,184
9Dec 3, 2024 17:59115,85975,686,12540,875,0001,993,0002,285,568