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 listMay 26, 2025 07:15E SequeiraE SequeiraScore: 74,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2025 07:1574,10552,761,60725,388,0002,031,0002,510,848
2May 26, 2025 07:1574,24351,488,68125,436,0002,034,0002,277,376
3May 26, 2025 07:1574,51149,864,55926,548,0001,021,0002,363,392