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 22, 2025 23:23Oleg KovalovOleg KovalovScore: 1,233,354Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 23:231,178,470460,408,522241,019,000195,015,0002,392,064
2Jan 22, 2025 23:231,233,354486,344,393275,602,000180,739,0002,342,912
3Jan 22, 2025 23:231,247,922484,492,452265,845,000195,886,0002,412,544