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 2, 2026 12:39IlyaIlyaScore: 58,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 12:4558,85631,335,24320,595,0001,182,0002,113,536
2Jul 2, 2026 12:4558,92931,308,57420,688,0001,116,0002,113,536
3Jul 2, 2026 12:4558,94331,301,98320,636,0001,173,0002,113,536
4Jul 2, 2026 12:4558,98331,262,43420,645,0001,179,0002,113,536
5Jul 2, 2026 12:4558,99131,284,70620,670,0001,157,0002,113,536
6Jul 2, 2026 12:4558,99131,329,15620,731,0001,096,0002,113,536
7Jul 2, 2026 12:4559,18932,763,04620,684,0001,216,0002,113,536
8Jul 2, 2026 12:4559,23731,863,34420,723,0001,195,0002,113,536
9Jul 2, 2026 12:4559,24831,457,38020,727,0001,195,0002,113,536