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 22:04Tomislav TunkovicTomislav TunkovicScore: 117,667Success
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 22:06117,21651,683,47042,353,0001,017,0002,117,632stderr
2Aug 14, 2026 22:06117,36451,687,08342,331,0001,094,0002,117,632stderr
3Aug 14, 2026 22:06117,47552,562,66942,439,0001,027,0002,117,632stderr
4Aug 14, 2026 22:06117,60551,670,48042,438,0001,076,0002,117,632stderr
5Aug 14, 2026 22:06117,66751,917,53742,513,0001,024,0002,117,632stderr
6Aug 14, 2026 22:06117,76752,637,46142,505,0001,069,0002,117,632stderr
7Aug 14, 2026 22:06117,80852,104,59142,561,0001,028,0002,117,632stderr
8Aug 14, 2026 22:06117,98351,833,81742,647,0001,007,0002,117,632stderr
9Aug 14, 2026 22:06118,12452,002,41642,688,0001,018,0002,117,632stderr