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 16, 2025 00:50emily graceemily graceScore: 350,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2025 00:50342,246154,393,776125,626,0001,005,0002,289,664
2Apr 16, 2025 00:50350,162156,090,582128,556,0001,004,0002,289,664
3Apr 16, 2025 00:50359,670155,563,348131,077,0002,001,0002,400,256