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 listMay 22, 2024 15:08Maxim ElchuginMaxim ElchuginScore: 22,184,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2024 15:0822,053,6398,219,413,4698,159,846,35402,273,280
2May 22, 2024 15:0822,184,6658,296,034,4848,208,325,97402,277,376
3May 22, 2024 15:0822,243,3608,290,196,8808,230,043,25302,285,568