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 19, 2026 17:01Dominique GarmierDominique GarmierScore: 72,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 17:0172,56255,166,07825,854,000994,0002,289,664
2Mar 19, 2026 17:0172,56856,761,36524,862,0001,988,0002,269,184
3Mar 19, 2026 17:0172,57353,235,47624,863,0001,989,0002,289,664