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 listMar 29, 2026 00:54Dominique GarmierDominique GarmierScore: 249,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 00:54249,122117,546,90091,174,0001,001,0002,289,664
2Mar 29, 2026 00:54249,249116,523,66491,220,0001,002,0002,334,720
3Mar 29, 2026 00:54249,468113,704,33490,297,0002,006,0002,535,424