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 18:44Yurkov AlekseyYurkov AlekseyScore: 22,308,280Success
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 18:4422,211,8878,289,740,9828,218,398,18702,277,376
2Jul 8, 2021 18:4422,308,2808,333,361,8508,254,063,50402,289,664
3Jul 8, 2021 18:4422,326,6248,325,684,6628,260,850,87902,285,568