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:48emily graceemily graceScore: 1,639,941Success
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:481,441,730558,654,810519,455,00013,985,0002,478,080
2Apr 16, 2025 00:481,639,941630,698,929587,785,00018,993,0002,506,752
3Apr 16, 2025 00:481,816,027702,252,216650,933,00020,997,0002,420,736