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 25, 2026 22:27IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 22:28032,884,63222,345,0001,224,0002,113,536expected "429496512900 ", got "429496508977 "
2Jun 25, 2026 22:2863,11632,544,46122,255,0001,098,0002,113,536
3Jun 25, 2026 22:2863,14032,545,45822,239,0001,123,0002,113,536
4Jun 25, 2026 22:2863,35432,867,12222,237,0001,204,0002,113,536
5Jun 25, 2026 22:2863,35433,216,82822,225,0001,216,0002,113,536
6Jun 25, 2026 22:2863,42933,255,68522,231,0001,238,0002,113,536
7Jun 25, 2026 22:2863,45133,157,37422,268,0001,209,0002,113,536
8Jun 25, 2026 22:2863,64832,762,80122,335,0001,215,0002,113,536
9Jun 25, 2026 22:2863,77533,211,77922,386,0001,211,0002,113,536