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 05:09Josu San MartinJosu San MartinScore: 71,803Success
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 05:0971,57848,977,21126,484,00002,478,080
2Jan 12, 2026 05:0971,80353,281,93925,546,0001,021,0002,289,664
3Jan 12, 2026 05:0973,18156,164,07925,072,0002,005,0002,367,488