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 listJun 30, 2026 22:22IlyaIlyaScore: 59,348Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 22:2458,95431,256,97720,608,0001,205,0002,113,536
2Jun 30, 2026 22:2458,96731,265,05920,632,0001,186,0002,113,536
3Jun 30, 2026 22:2458,97831,787,16620,614,0001,208,0002,113,536
4Jun 30, 2026 22:2459,08931,793,34120,684,0001,179,0002,113,536
5Jun 30, 2026 22:2459,34831,941,59220,707,0001,252,0002,113,536
6Jun 30, 2026 22:2421,619,6728,008,996,8037,840,655,000158,624,0002,113,536
7Jun 30, 2026 22:2421,636,6408,015,534,7227,852,466,000153,091,0002,113,536
8Jun 30, 2026 22:2421,652,5518,021,527,2407,854,333,000157,111,0002,113,536
9Jun 30, 2026 22:2421,666,0678,026,443,8917,859,000,000157,445,0002,113,536