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 18:52izotoffizotoffScore: 81,516Success
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 18:5281,34359,951,53528,091,0002,006,0002,330,624
2Mar 21, 2026 18:5281,35758,550,04529,099,0001,003,0002,531,328
3Mar 21, 2026 18:5281,38159,553,60227,100,0003,011,0002,318,336
4Mar 21, 2026 18:5281,39759,970,86128,110,0002,007,0002,535,424
5Mar 21, 2026 18:5281,51657,934,72028,151,0002,010,0002,523,136
6Mar 21, 2026 18:5281,84158,573,79127,253,0003,028,0002,547,712
7Mar 21, 2026 18:5281,92454,199,13925,260,0005,052,0002,318,336
8Mar 21, 2026 18:5281,96253,468,84528,305,0002,021,0002,322,432
9Mar 21, 2026 18:5282,14350,235,99428,367,0002,026,0002,310,144