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 11, 2026 20:41Victor MerckléVictor MerckléScore: 64,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 20:4264,38934,595,84722,777,0001,047,0002,113,536
2May 11, 2026 20:4264,55432,571,71122,874,0001,011,0002,113,536
3May 11, 2026 20:4264,57035,034,15522,879,0001,012,0002,113,536
4May 11, 2026 20:4264,58632,766,24622,879,0001,018,0002,113,536
5May 11, 2026 20:4264,66234,702,18322,844,0001,081,0002,113,536
6May 11, 2026 20:4264,68632,671,88722,847,0001,087,0002,113,536
7May 11, 2026 20:4265,01835,120,06423,032,0001,025,0002,113,536
8May 11, 2026 20:4265,08332,848,51723,055,0001,026,0002,113,536
9May 11, 2026 20:4265,23232,984,79623,035,0001,101,0002,113,536