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 listApr 5, 2026 08:24CemaCemaScore: 74,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 5, 2026 08:2473,59548,391,15125,213,0002,017,0002,289,664
2Apr 5, 2026 08:2473,62252,446,43725,223,0002,017,0002,523,136
3Apr 5, 2026 08:2473,94651,141,43026,347,0001,013,0002,289,664
4Apr 5, 2026 08:2474,04959,368,86925,369,0002,029,0002,289,664
5Apr 5, 2026 08:2474,14954,728,86426,419,0001,016,0002,273,280
6Apr 5, 2026 08:2474,34149,604,55026,488,0001,018,0002,269,184
7Apr 5, 2026 08:2474,43250,724,79826,520,0001,020,0002,289,664
8Apr 5, 2026 08:2474,51951,486,28426,551,0001,021,0002,523,136
9Apr 5, 2026 08:2475,10558,854,73524,812,0002,977,0002,527,232