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 listSep 12, 2026 09:55Haha ExpertHaha ExpertScore: 68,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 09:5667,94333,790,26924,127,0001,012,0002,117,632
2Sep 12, 2026 09:5668,24033,889,48524,225,0001,024,0002,117,632
3Sep 12, 2026 09:5668,24833,800,34324,205,0001,047,0002,117,632
4Sep 12, 2026 09:5668,28633,919,36624,235,0001,031,0002,117,632
5Sep 12, 2026 09:5668,40533,801,04624,238,0001,072,0002,117,632
6Sep 12, 2026 09:5668,43233,955,01224,275,0001,045,0002,117,632
7Sep 12, 2026 09:5668,46434,716,05524,289,0001,043,0002,117,632
8Sep 12, 2026 09:5668,97034,147,93024,493,0001,026,0002,117,632
9Sep 12, 2026 09:5669,10834,175,00124,533,0001,037,0002,117,632