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 24, 2026 10:29Charles CabergsCharles CabergsScore: 70,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 10:3170,76441,775,66024,169,0002,014,0002,363,392
2Apr 24, 2026 10:3170,77843,604,90625,181,0001,007,0002,367,488
3Apr 24, 2026 10:3170,78344,772,86724,176,0002,014,0002,363,392
4Apr 24, 2026 10:3170,89441,523,37125,223,0001,008,0002,310,144
5Apr 24, 2026 10:3170,89750,209,68624,215,0002,017,0002,351,104
6Apr 24, 2026 10:3171,01644,609,27324,255,0002,021,0002,363,392
7Apr 24, 2026 10:3171,02146,194,53525,268,0001,010,0002,367,488
8Apr 24, 2026 10:3171,04846,570,67324,266,0002,022,0002,355,200
9Apr 24, 2026 10:3171,17543,704,99525,323,0001,012,0002,363,392