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 18:57Elijah KinElijah KinScore: 3,214,803Success
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 18:573,214,6591,215,393,7411,135,451,00053,973,0002,273,280
2Mar 15, 2026 18:573,214,8031,216,557,5481,131,503,00057,974,0002,273,280
3Mar 15, 2026 18:573,220,2031,214,195,3811,148,494,00042,981,0002,273,280