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 22, 2026 18:58Dominique GarmierDominique GarmierScore: 675,314Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 18:58675,278273,555,228248,854,000999,0002,363,392
2Mar 22, 2026 18:58675,314282,998,894248,867,000999,0002,359,296
3Mar 22, 2026 18:58684,030276,796,754253,091,00002,281,472