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 listMar 15, 2026 22:11Elijah KinElijah KinScore: 152,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:11151,42284,107,67817,008,00039,018,0002,285,568
2Mar 15, 2026 22:11152,63277,405,05511,093,00045,381,0002,285,568
3Mar 15, 2026 22:11155,09778,677,0739,061,00048,325,0002,469,888