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 07:44Dominique GarmierDominique GarmierScore: 83,408Success
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 07:4482,84162,693,06229,630,0001,021,0002,457,600
2Mar 30, 2026 07:4483,40860,307,42530,861,00002,510,848
3Mar 30, 2026 07:4483,47354,305,57727,897,0002,988,0002,445,312