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 15, 2026 22:16Dominique GarmierDominique GarmierScore: 72,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 22:1672,56250,485,95225,854,000994,0002,273,280
2Mar 15, 2026 22:1672,57357,404,34924,863,0001,989,0002,273,280
3Mar 15, 2026 22:1672,57653,433,15425,859,000994,0002,412,544
4Mar 15, 2026 22:1672,58952,605,66024,869,0001,989,0002,387,968
5Mar 15, 2026 22:1672,59251,739,95625,865,000994,0002,273,280
6Mar 15, 2026 22:1672,62453,378,22225,876,000995,0002,400,256
7Mar 15, 2026 22:1672,89253,648,51524,973,0001,997,0002,502,656
8Mar 15, 2026 22:1673,02754,604,36626,020,0001,000,0002,273,280
9Mar 15, 2026 22:1673,07654,126,79225,036,0002,002,0002,404,352