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 14:26Josu San MartinJosu San MartinScore: 70,508Success
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 14:2670,46848,233,80224,068,0002,005,0002,449,408
2Jan 12, 2026 14:2670,50857,330,61625,085,0001,003,0002,359,296
3Jan 12, 2026 14:2670,88953,356,77824,212,0002,017,0002,502,656