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 5, 2026 00:57olliecrowolliecrowScore: 70,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 5, 2026 00:5770,23851,926,33325,988,00002,281,472
2Mar 5, 2026 00:5770,37856,462,51125,039,0001,001,0002,281,472
3Mar 5, 2026 00:5770,58154,129,14425,111,0001,004,0002,510,848