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 21, 2026 15:31izotoffizotoffScore: 115,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 15:31115,14672,567,12142,604,00002,396,160
2Mar 21, 2026 15:31115,19266,868,17742,621,00002,412,544
3Mar 21, 2026 15:31115,63565,950,82441,790,000995,0002,412,544
4Mar 21, 2026 15:31115,68666,658,67441,809,000995,0002,400,256
5Mar 21, 2026 15:31115,79770,852,08741,849,000996,0002,404,352
6Mar 21, 2026 15:31115,80068,980,24342,846,00002,416,640
7Mar 21, 2026 15:31116,38669,432,40341,013,0002,050,0002,322,432
8Mar 21, 2026 15:31116,38972,222,24540,060,0003,004,0002,322,432
9Mar 21, 2026 15:31116,52772,694,09641,110,0002,005,0002,322,432