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 08:03IlyaIlyaScore: 61,872Success
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 08:0761,51332,273,76121,651,0001,109,0002,113,536
2Jun 30, 2026 08:0761,53232,223,53521,663,0001,104,0002,113,536
3Jun 30, 2026 08:0761,69732,332,51121,716,0001,112,0002,113,536
4Jun 30, 2026 08:0761,81832,900,05921,664,0001,209,0002,113,536
5Jun 30, 2026 08:0761,87232,414,06521,750,0001,143,0002,113,536
6Jun 30, 2026 08:0762,04332,910,75621,744,0001,212,0002,113,536
7Jun 30, 2026 08:0762,13232,914,18221,792,0001,197,0002,113,536
8Jun 30, 2026 08:0762,18132,963,74021,783,0001,224,0002,113,536
9Jun 30, 2026 08:0762,18932,947,24121,792,0001,218,0002,113,536