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 listJun 21, 2026 06:33Elijah KinElijah KinScore: 107,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 06:34106,59748,489,37138,417,0001,024,0002,113,536
2Jun 21, 2026 06:34106,61348,499,33438,344,0001,103,0002,113,536
3Jun 21, 2026 06:34106,62748,452,73038,330,0001,122,0002,113,536
4Jun 21, 2026 06:34106,88949,861,63838,425,0001,124,0002,113,536
5Jun 21, 2026 06:34107,12748,691,25038,534,0001,103,0002,113,536
6Jun 21, 2026 06:34107,14548,854,21638,529,0001,115,0002,113,536
7Jun 21, 2026 06:34107,22148,572,06138,568,0001,104,0002,113,536
8Jun 21, 2026 06:34107,25648,726,89438,584,0001,101,0002,113,536
9Jun 21, 2026 06:34107,62948,831,90038,702,0001,121,0002,113,536