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 8, 2026 23:19IlyaIlyaScore: 58,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 23:2158,31331,216,39120,487,0001,089,0002,113,536
2Jul 8, 2026 23:2158,32931,296,94120,467,0001,115,0002,113,536
3Jul 8, 2026 23:2158,55931,325,56920,557,0001,110,0002,113,536
4Jul 8, 2026 23:2158,67231,368,23920,524,0001,185,0002,113,536
5Jul 8, 2026 23:2158,79431,418,85220,553,0001,201,0002,113,536
6Jul 8, 2026 23:2158,84831,747,16220,590,0001,184,0002,113,536
7Jul 8, 2026 23:2158,86432,155,59120,572,0001,208,0002,113,536
8Jul 8, 2026 23:2121,498,2027,964,603,0047,801,195,000153,140,0002,113,536
9Jul 8, 2026 23:2121,643,3898,018,319,3557,860,352,000147,702,0002,113,536