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 listAug 14, 2026 23:40Tomislav TunkovicTomislav TunkovicScore: 816,602Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 23:41815,086309,981,880300,489,0001,093,0002,117,632stderr
2Aug 14, 2026 23:41815,743310,300,671300,772,0001,053,0002,117,632stderr
3Aug 14, 2026 23:41816,143310,272,016300,968,0001,005,0002,117,632stderr
4Aug 14, 2026 23:41816,448310,457,575300,986,0001,100,0002,117,632stderr
5Aug 14, 2026 23:41816,602310,430,296301,140,0001,003,0002,117,632stderr
6Aug 14, 2026 23:41816,716310,603,732301,178,0001,007,0002,117,632stderr
7Aug 14, 2026 23:41818,054311,000,911301,603,0001,077,0002,117,632stderr
8Aug 14, 2026 23:41818,216311,243,418301,721,0001,019,0002,117,632stderr
9Aug 14, 2026 23:41818,364311,139,481301,714,0001,081,0002,117,632stderr