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 listJun 6, 2026 10:49Victor MerckléVictor MerckléScore: 64,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 10:5063,75432,720,98722,539,0001,050,0002,113,536
2Jun 6, 2026 10:5063,76432,631,20922,541,0001,052,0002,113,536
3Jun 6, 2026 10:5063,78132,663,31822,534,0001,065,0002,113,536
4Jun 6, 2026 10:5063,94032,723,43622,593,0001,065,0002,113,536
5Jun 6, 2026 10:5064,05134,521,37622,571,0001,128,0002,113,536
6Jun 6, 2026 10:5064,10032,838,84222,577,0001,140,0002,113,536
7Jun 6, 2026 10:5064,47232,922,08822,716,0001,139,0002,113,536
8Jun 6, 2026 10:5064,52933,014,27222,725,0001,151,0002,113,536
9Jun 6, 2026 10:5064,81633,083,73022,896,0001,086,0002,113,536