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:19CheranMahalingamCheranMahalingamScore: 739,646Success
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:19734,751298,474,46677,959,000193,899,0002,269,184
2Sep 20, 2024 18:19737,157301,949,12178,927,000193,821,0002,269,184
3Sep 20, 2024 18:19737,762294,435,94165,993,000206,979,0002,510,848
4Sep 20, 2024 18:19739,438297,751,97581,878,000191,714,0002,310,144
5Sep 20, 2024 18:19739,646306,653,50371,913,000201,756,0002,392,064
6Sep 20, 2024 18:19739,973301,232,35575,942,000197,848,0002,420,736
7Sep 20, 2024 18:19748,376304,615,39767,975,000208,924,0002,478,080
8Sep 20, 2024 18:19749,757308,616,29378,832,000198,578,0002,359,296
9Sep 20, 2024 18:19750,303308,755,80775,894,000201,718,0002,297,856