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 listMar 27, 2023 21:38Yurkov AlekseyYurkov AlekseyScore: 242,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2023 21:38240,071157,254,91188,826,10002,260,992
2Mar 27, 2023 21:38242,116169,410,23489,583,07902,248,704
3Mar 27, 2023 21:38251,603156,313,01493,093,18402,269,184