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 16, 2025 00:48emily graceemily graceScore: 119,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2025 00:48116,13574,453,33140,972,0001,998,0002,293,760
2Apr 16, 2025 00:55116,60579,048,06241,138,0002,006,0002,510,848
3Apr 16, 2025 00:55117,95970,138,80142,630,0001,015,0002,387,968
4Apr 16, 2025 00:48119,02471,241,89640,036,0004,003,0002,404,352
5Apr 16, 2025 00:48121,08671,319,48041,816,0002,986,0002,297,856
6Apr 16, 2025 00:55121,21668,305,09342,857,0001,993,0002,306,048