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 11:13IlyaIlyaError
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 11:18057,931,87247,208,0001,130,0002,113,536expected "429496463526 ", got "429496478936 "
2Jul 3, 2026 11:1860,57831,915,68921,292,0001,122,0002,113,536
3Jul 3, 2026 11:1860,62432,088,31721,313,0001,118,0002,113,536
4Jul 3, 2026 11:1860,62731,942,60321,321,0001,111,0002,113,536
5Jul 3, 2026 11:1860,79732,008,51221,303,0001,192,0002,113,536
6Jul 3, 2026 11:1860,87832,072,18721,408,0001,117,0002,113,536
7Jul 3, 2026 11:1860,96731,996,22021,342,0001,216,0002,113,536
8Jul 3, 2026 11:1860,97832,058,40921,422,0001,140,0002,113,536
9Jul 3, 2026 11:1860,99132,123,90621,430,0001,137,0002,113,536