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 listJan 22, 2025 16:11Oleg KovalovOleg KovalovScore: 499,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 16:11498,846219,108,324139,433,00045,140,0002,289,664
2Jan 22, 2025 16:11499,962211,194,090130,990,00053,996,0002,289,664
3Jan 22, 2025 16:11500,119212,770,133130,031,00055,013,0002,281,472