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 21, 2026 19:40Dominique GarmierDominique GarmierScore: 328,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 19:40327,400141,429,723119,136,0002,002,0002,531,328
2Mar 21, 2026 19:40328,124142,729,803120,403,0001,003,0002,334,720
3Mar 21, 2026 19:40331,146146,438,359121,520,0001,004,0002,322,432