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 04:22CemaCemaScore: 21,784,623Success
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 04:2221,715,0408,105,759,7738,034,564,77002,269,184
2May 22, 2024 04:2221,784,6238,134,820,4418,060,310,37502,260,992
3May 22, 2024 04:2221,938,1748,173,899,9658,117,124,28602,277,376