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 10:51IlyaIlyaScore: 60,483Success
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 10:5260,12131,734,91821,135,0001,110,0002,113,536
2Jun 30, 2026 10:5260,15131,757,54721,160,0001,096,0002,113,536
3Jun 30, 2026 10:5260,25931,742,83121,178,0001,118,0002,113,536
4Jun 30, 2026 10:5260,33531,835,60621,140,0001,184,0002,113,536
5Jun 30, 2026 10:5260,48331,818,23721,259,0001,120,0002,113,536
6Jun 30, 2026 10:5260,51632,411,18321,178,0001,213,0002,113,536
7Jun 30, 2026 10:5260,58132,552,66921,191,0001,224,0002,113,536
8Jun 30, 2026 10:5260,58631,893,99221,211,0001,206,0002,113,536
9Jun 30, 2026 10:5260,64832,332,76721,230,0001,210,0002,113,536