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 listMay 17, 2026 11:56M-RochatM-RochatScore: 60,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 11:5960,20831,407,54421,265,0001,012,0002,113,536
2May 17, 2026 11:5960,22731,632,77821,241,0001,043,0002,113,536
3May 17, 2026 11:5960,33532,130,11121,310,0001,014,0002,113,536
4May 17, 2026 11:5960,40231,498,92921,264,0001,085,0002,113,536
5May 17, 2026 11:5960,44331,118,06321,360,0001,004,0002,113,536
6May 17, 2026 11:5960,58335,478,64721,363,0001,053,0002,113,536
7May 17, 2026 11:5960,60231,225,69821,345,0001,078,0002,113,536
8May 17, 2026 11:5960,76432,468,69221,380,0001,103,0002,113,536
9May 17, 2026 11:5960,91331,658,42821,458,0001,080,0002,113,536