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 20, 2024 18:32CheranMahalingamCheranMahalingamScore: 739,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2024 18:32732,778294,672,52876,036,000195,092,0002,281,472
2Sep 20, 2024 18:32736,627300,056,68777,872,000194,680,0002,301,952
3Sep 20, 2024 18:32737,886295,399,40069,004,000204,014,0002,310,144
4Sep 20, 2024 18:32738,435301,111,60977,062,000196,159,0002,281,472
5Sep 20, 2024 18:32739,349299,257,99273,881,000199,678,0002,400,256
6Sep 20, 2024 18:32739,403302,460,26566,897,000206,682,0002,506,752
7Sep 20, 2024 18:32746,924306,796,68070,836,000205,526,0002,494,464
8Sep 20, 2024 18:32747,197306,876,70165,872,000210,591,0002,301,952
9Sep 20, 2024 18:32750,684302,942,78580,928,000196,825,0002,318,336