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 listOct 14, 2024 17:46Joad NacerJoad NacerScore: 67,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 17:4666,43253,050,11123,556,0001,024,0002,273,280
2Oct 14, 2024 17:4667,18154,744,61822,869,0001,988,0002,535,424
3Oct 14, 2024 17:4667,26554,657,42923,893,000995,0002,273,280