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 13, 2026 00:07Josu San MartinJosu San MartinScore: 70,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 00:0770,09558,123,66423,940,0001,995,0002,367,488
2Jan 13, 2026 00:0770,30852,425,86524,013,0002,001,0002,289,664
3Jan 13, 2026 00:0770,41652,044,43224,050,0002,004,0002,367,488