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 27, 2024 16:03Joad NacerJoad NacerScore: 70,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 16:0368,882104,335,42525,486,21202,256,896
2Jul 27, 2024 16:0370,30792,855,65626,013,56402,281,472
3Jul 27, 2024 16:0370,61384,520,20726,126,85602,359,296