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 16, 2025 14:44Aniruddha DebAniruddha DebScore: 68,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 14:4468,28447,548,01024,255,0001,010,0002,519,040
2Aug 16, 2025 14:4468,57045,736,21225,371,00002,498,560
3Aug 16, 2025 14:4468,93046,763,30025,504,00002,519,040