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 listApr 23, 2026 16:55Charles CabergsCharles CabergsScore: 70,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 16:5670,57549,188,20425,109,0001,004,0002,351,104
2Apr 23, 2026 16:5670,73546,491,61824,159,0002,013,0002,347,008
3Apr 23, 2026 16:5670,77540,294,45724,173,0002,014,0002,355,200
4Apr 23, 2026 16:5670,79143,542,14225,186,0001,007,0002,359,296
5Apr 23, 2026 16:5670,79742,387,28824,180,0002,015,0002,347,008
6Apr 23, 2026 16:5670,83541,398,42624,193,0002,016,0002,359,296
7Apr 23, 2026 16:5670,99747,939,66125,259,0001,010,0002,351,104
8Apr 23, 2026 16:5671,05444,049,00625,279,0001,011,0002,355,200
9Apr 23, 2026 16:5671,14341,501,24525,311,0001,012,0002,347,008