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 07:35IlyaIlyaScore: 21,488,694Success
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 07:3721,387,6297,923,072,6387,758,984,000154,439,0002,113,536
2Jun 30, 2026 07:3721,438,9277,942,043,3597,775,236,000157,167,0002,113,536
3Jun 30, 2026 07:3721,458,5567,950,244,0337,784,833,000154,833,0002,113,536
4Jun 30, 2026 07:3721,468,0377,952,820,4317,786,392,000156,782,0002,113,536
5Jun 30, 2026 07:3721,488,6947,960,506,2787,794,206,000156,611,0002,113,536
6Jun 30, 2026 07:3721,535,6107,977,977,1427,809,168,000159,008,0002,113,536
7Jun 30, 2026 07:3721,553,8457,984,633,7657,816,528,000158,395,0002,113,536
8Jun 30, 2026 07:3721,570,9377,991,171,1947,822,312,000158,935,0002,113,536
9Jun 30, 2026 07:3721,579,6407,995,051,4497,830,070,000154,397,0002,113,536