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 listJul 8, 2021 19:59Yurkov AlekseyYurkov AlekseyScore: 436,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 19:59436,302215,197,231161,431,64102,297,856
2Jul 8, 2021 19:59436,333222,292,963161,443,32602,281,472
3Jul 8, 2021 19:59438,068221,207,280162,085,18202,297,856