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 2, 2026 23:00A_ShamanA_ShamanScore: 73,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 23:0172,76236,876,15025,878,0001,044,0002,113,536
2Jul 2, 2026 23:0172,84836,972,01325,908,0001,046,0002,113,536
3Jul 2, 2026 23:0172,94337,006,10025,939,0001,050,0002,113,536
4Jul 2, 2026 23:0172,95936,900,30825,949,0001,046,0002,113,536
5Jul 2, 2026 23:0173,03537,046,85925,978,0001,045,0002,113,536
6Jul 2, 2026 23:0173,05636,974,60025,986,0001,045,0002,113,536
7Jul 2, 2026 23:0173,16237,099,11626,024,0001,046,0002,113,536
8Jul 2, 2026 23:0173,17237,037,02626,030,0001,044,0002,113,536
9Jul 2, 2026 23:0173,53537,208,62526,158,0001,050,0002,113,536