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 listJun 8, 2024 13:51Joad NacerJoad NacerScore: 69,155Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2024 13:5168,54795,600,49425,362,56202,265,088
2Jun 8, 2024 13:5169,15593,040,75525,587,19202,277,376
3Jun 8, 2024 13:5169,48597,665,26125,709,52802,265,088