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 11:04IlyaIlyaScore: 20,879,754Success
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 11:0620,774,7057,696,578,4727,531,701,000154,940,0002,113,536
2Jun 30, 2026 11:0620,821,3217,713,512,7457,548,860,000155,029,0002,113,536
3Jun 30, 2026 11:0620,825,1707,715,997,9327,550,427,000154,886,0002,113,536
4Jun 30, 2026 11:0620,871,4757,732,447,1377,567,029,000155,417,0002,113,536
5Jun 30, 2026 11:0620,879,7547,735,544,9077,568,722,000156,787,0002,113,536
6Jun 30, 2026 11:0620,895,0627,741,186,3547,573,920,000157,253,0002,113,536
7Jun 30, 2026 11:0620,920,8487,750,487,9437,583,648,000157,066,0002,113,536
8Jun 30, 2026 11:0620,943,3897,759,564,7067,591,543,000157,511,0002,113,536
9Jun 30, 2026 11:0620,985,0247,774,143,3077,604,179,000160,280,0002,113,536