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 21:59Yurkov AlekseyYurkov AlekseyScore: 145,515Success
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 21:59145,160105,876,67753,709,36102,269,184
2Jul 8, 2021 21:59145,515107,840,00453,840,45602,265,088
3Jul 8, 2021 21:59145,854115,296,80053,966,05902,260,992