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 listMar 25, 2026 18:39Dominique GarmierDominique GarmierScore: 121,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 10:34120,16564,489,73943,451,0001,010,0002,486,272
2Mar 26, 2026 10:34120,26263,801,53543,486,0001,011,0002,531,328
3Mar 26, 2026 10:34120,43867,254,88943,550,0001,012,0002,277,376
4Mar 25, 2026 18:39121,32266,494,72442,894,0001,995,0002,277,376
5Mar 25, 2026 18:39121,54369,193,56742,973,0001,998,0002,277,376
6Mar 25, 2026 18:39122,40080,592,18444,282,0001,006,0002,277,376