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 listJul 3, 2026 11:14IlyaIlyaScore: 64,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 11:2264,51633,185,87022,729,0001,142,0002,113,536
2Jul 3, 2026 11:2264,55633,387,71322,780,0001,106,0002,113,536
3Jul 3, 2026 11:2264,64333,424,68822,728,0001,190,0002,113,536
4Jul 3, 2026 11:2264,66733,651,90422,738,0001,189,0002,113,536
5Jul 3, 2026 11:2264,67833,386,25222,825,0001,106,0002,113,536
6Jul 3, 2026 11:2264,82733,531,85722,861,0001,125,0002,113,536
7Jul 3, 2026 11:2265,05633,577,40722,892,0001,179,0002,113,536
8Jul 3, 2026 11:2265,22734,070,72522,899,0001,235,0002,113,536
9Jul 3, 2026 11:2265,44034,151,35623,009,0001,204,0002,113,536