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 listJun 30, 2026 14:36IlyaIlyaError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 14:38033,175,85921,961,0001,244,0002,113,536expected "429496497518 ", got "429496500810 "
2Jun 30, 2026 14:38034,601,24121,990,0001,202,0002,113,536expected "429496521247 ", got "429496518201 "
3Jun 30, 2026 14:38033,347,32122,323,0001,104,0002,113,536expected "429496531000 ", got "429496529537 "
4Jun 30, 2026 14:38032,671,48822,021,0001,120,0002,113,536expected "429496577321 ", got "429496578196 "
5Jun 30, 2026 14:3862,48632,619,20022,015,0001,105,0002,113,536
6Jun 30, 2026 14:3862,51332,640,00121,970,0001,160,0002,113,536
7Jun 30, 2026 14:3862,60233,062,89421,961,0001,202,0002,113,536
8Jun 30, 2026 14:3862,65133,391,60021,971,0001,210,0002,113,536
9Jun 30, 2026 14:3862,93533,093,49322,071,0001,215,0002,113,536