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 30, 2026 05:54limanjun99limanjun99Score: 61,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 05:5461,80850,887,54720,881,0001,988,0002,408,448
2Mar 30, 2026 05:5461,91650,329,35320,917,0001,992,0002,281,472
3Mar 30, 2026 05:5461,95947,104,66021,929,000996,0002,281,472