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 listJan 28, 2025 09:27mebowlermebowlerScore: 1,604,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 09:271,574,643612,819,254535,649,00046,969,0002,523,136
2Jan 28, 2025 09:271,604,324619,105,465549,630,00043,970,0002,322,432
3Jan 28, 2025 09:271,670,622645,189,083574,121,00044,009,0002,523,136