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 30, 2026 07:40IlyaIlyaScore: 59,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 07:4259,54331,544,09820,856,0001,175,0002,113,536
2Jun 30, 2026 07:4259,56231,530,77220,815,0001,223,0002,113,536
3Jun 30, 2026 07:4259,60531,968,70320,864,0001,190,0002,113,536
4Jun 30, 2026 07:4259,65132,010,44820,866,0001,205,0002,113,536
5Jun 30, 2026 07:4259,70033,368,33020,890,0001,199,0002,113,536
6Jun 30, 2026 07:4259,79732,066,47520,907,0001,218,0002,113,536
7Jun 30, 2026 07:4259,86432,050,21420,920,0001,230,0002,113,536
8Jun 30, 2026 07:4259,86731,794,74320,934,0001,217,0002,113,536
9Jun 30, 2026 07:4259,87032,159,51920,930,0001,222,0002,113,536