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 listMar 15, 2026 22:57Dominique GarmierDominique GarmierScore: 71,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:5771,11654,884,34024,289,0002,024,0002,273,280
2Mar 15, 2026 22:5771,28948,516,30125,363,0001,014,0002,514,944
3Mar 15, 2026 22:5771,76845,103,73826,554,00002,273,280