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 25, 2026 00:30Dominique GarmierDominique GarmierScore: 500,238Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 00:30498,257216,368,779184,355,00002,514,944
2Mar 25, 2026 00:30500,238210,781,561182,087,0003,001,0002,322,432
3Mar 25, 2026 00:30500,470210,875,696184,174,0001,000,0002,412,544