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 listJan 12, 2026 04:31Josu San MartinJosu San MartinScore: 84,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 04:3184,59556,696,61729,281,0002,019,0002,363,392
2Jan 12, 2026 04:3184,93257,824,19929,398,0002,027,0002,359,296
3Jan 12, 2026 04:3185,50859,214,25530,618,0001,020,0002,457,600