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 27, 2026 00:14Dominique GarmierDominique GarmierScore: 70,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 00:1470,19546,626,92424,974,000998,0002,400,256
2Mar 27, 2026 00:1470,25149,875,23124,994,000999,0002,387,968
3Mar 27, 2026 00:1470,47847,687,74326,077,00002,281,472