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 listSep 26, 2026 19:32Kevin HeaveyKevin HeaveyScore: 53,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 19:3653,75128,702,77619,888,000020,480
2Sep 26, 2026 19:3653,76228,687,07419,892,000020,480
3Sep 26, 2026 19:3653,79428,737,37019,904,000020,480
4Sep 26, 2026 19:3653,81828,652,75119,913,000020,480
5Sep 26, 2026 19:3653,82428,665,21619,915,000020,480
6Sep 26, 2026 19:3653,84328,728,74919,922,000020,480
7Sep 26, 2026 19:3653,88928,724,77519,939,000020,480
8Sep 26, 2026 19:3653,89730,327,57019,942,000020,480
9Sep 26, 2026 19:3655,92942,442,62520,694,000020,480