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 29, 2026 23:59Dominique GarmierDominique GarmierScore: 349,014Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 23:59347,151157,172,980126,440,0002,006,0002,289,664
2Mar 29, 2026 23:59349,014157,163,635127,133,0002,002,0002,310,144
3Mar 29, 2026 23:59349,178155,458,273126,192,0003,004,0002,523,136