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 04:53Charles CabergsCharles CabergsScore: 72,732Success
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 04:5472,39446,150,15224,802,0001,984,0002,363,392
2Apr 27, 2026 04:5472,56443,648,22523,866,0002,983,0002,359,296
3Apr 27, 2026 04:5472,60044,149,64124,873,0001,989,0002,363,392
4Apr 27, 2026 04:5472,70545,542,99224,909,0001,992,0002,355,200
5Apr 27, 2026 04:5472,73245,526,83024,918,0001,993,0002,306,048
6Apr 27, 2026 04:5472,73743,119,76223,923,0002,990,0002,359,296
7Apr 27, 2026 04:5472,74341,708,62523,925,0002,990,0002,428,928
8Apr 27, 2026 04:5472,94043,796,44524,989,0001,999,0002,359,296
9Apr 27, 2026 04:5473,12947,090,23725,054,0002,004,0002,363,392