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 27, 2026 07:40Charles CabergsCharles CabergsScore: 70,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 07:4170,70244,071,48924,148,0002,012,0002,310,144
2Apr 27, 2026 07:4170,78940,646,04924,178,0002,014,0002,457,600
3Apr 27, 2026 07:4170,79747,247,87324,180,0002,015,0002,359,296
4Apr 27, 2026 07:4170,87240,932,31125,215,0001,008,0002,363,392
5Apr 27, 2026 07:4170,87542,989,16025,216,0001,008,0002,359,296
6Apr 27, 2026 07:4170,97543,955,69325,251,0001,010,0002,351,104
7Apr 27, 2026 07:4170,99142,714,45124,247,0002,020,0002,359,296
8Apr 27, 2026 07:4171,09445,626,41124,282,0002,023,0002,371,584
9Apr 27, 2026 07:4171,11346,387,75225,300,0001,012,0002,306,048