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 08:39mebowlermebowlerScore: 1,436,359Success
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 08:391,363,176534,301,709451,336,00053,039,0002,289,664
2Jan 28, 2025 08:391,436,359562,668,992483,503,00047,950,0002,457,600
3Jan 28, 2025 08:391,468,027573,511,038495,155,00048,015,0002,301,952