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 14:53M-RochatM-RochatScore: 63,897Success
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 14:5663,68333,519,45522,404,0001,159,0002,113,536
2May 17, 2026 14:5663,68335,516,57822,487,0001,076,0002,113,536
3May 17, 2026 14:5663,73733,241,81622,436,0001,147,0002,113,536
4May 17, 2026 14:5663,79135,103,75322,451,0001,152,0002,113,536
5May 17, 2026 14:5663,89736,438,66322,503,0001,139,0002,113,536
6May 17, 2026 14:5663,90832,934,04622,513,0001,133,0002,113,536
7May 17, 2026 14:5664,19732,905,13622,601,0001,152,0002,113,536
8May 17, 2026 14:5664,21833,508,63722,749,0001,012,0002,113,536
9May 17, 2026 14:5664,25934,361,58922,622,0001,154,0002,113,536