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 22:46IlyaIlyaScore: 21,399,045Success
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 22:4858,62431,309,69820,546,0001,145,0002,113,536
2Jul 8, 2026 22:4858,73231,424,96120,705,0001,026,0002,113,536
3Jul 8, 2026 22:4858,88932,018,18220,572,0001,217,0002,113,536
4Jul 8, 2026 22:4858,97232,146,17320,787,0001,033,0002,113,536
5Jul 8, 2026 22:4821,399,0457,928,421,7957,765,593,000152,054,0002,113,536
6Jul 8, 2026 22:4821,418,6087,935,353,0457,776,598,000148,287,0002,113,536
7Jul 8, 2026 22:4821,425,8457,937,510,9997,777,644,000149,919,0002,113,536
8Jul 8, 2026 22:4821,464,3547,951,713,9957,791,424,000150,387,0002,113,536
9Jul 8, 2026 22:4821,536,1627,980,601,9867,816,366,000152,014,0002,113,536