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:10Elijah KinElijah KinScore: 154,376Success
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:10151,42784,304,02614,007,00042,021,0002,473,984
2Mar 15, 2026 22:10154,37679,921,54818,037,00039,082,0002,285,568
3Mar 15, 2026 22:10154,92784,984,97010,871,00046,452,0002,285,568