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 listJul 3, 2026 07:57IlyaIlyaScore: 60,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 07:5859,82132,996,72021,010,0001,124,0002,113,536
2Jul 3, 2026 07:5859,85131,682,88920,949,0001,196,0002,113,536
3Jul 3, 2026 07:5859,85431,654,92020,942,0001,204,0002,113,536
4Jul 3, 2026 07:5859,89731,722,73521,044,0001,118,0002,113,536
5Jul 3, 2026 07:5860,10032,228,95521,026,0001,211,0002,113,536
6Jul 3, 2026 07:5860,12932,231,99621,043,0001,205,0002,113,536
7Jul 3, 2026 07:5860,16432,267,23621,031,0001,230,0002,113,536
8Jul 3, 2026 07:5860,35932,368,06621,107,0001,226,0002,113,536
9Jul 3, 2026 07:5860,39432,414,72121,106,0001,240,0002,113,536