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 10, 2026 13:41Tomislav TunkovicTomislav TunkovicScore: 399,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 10, 2026 13:58397,348157,294,19879,724,00067,295,0002,117,632stderr
2Sep 10, 2026 13:58397,362157,269,83579,527,00067,497,0002,117,632stderr
3Sep 10, 2026 13:58397,778157,407,42679,530,00067,648,0002,117,632stderr
4Sep 10, 2026 13:58398,872157,969,05679,613,00067,970,0002,117,632stderr
5Sep 10, 2026 13:58399,481158,078,81979,664,00068,144,0002,117,632stderr
6Sep 10, 2026 13:58400,181158,427,74679,800,00068,267,0002,117,632stderr
7Sep 10, 2026 13:58400,237158,413,26779,778,00068,310,0002,117,632stderr
8Sep 10, 2026 13:58400,451158,497,22980,053,00068,114,0002,117,632stderr
9Sep 10, 2026 13:58400,686158,433,89679,764,00068,490,0002,117,632stderr