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 listApr 20, 2025 15:01Drew GarciaDrew GarciaScore: 76,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2025 15:0176,47652,962,39025,265,0003,031,0002,281,472
2Apr 20, 2025 15:0176,68951,130,10326,349,0002,026,0002,281,472
3Apr 20, 2025 15:0177,04652,624,89226,471,0002,036,0002,379,776