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 22, 2026 08:10Dominique GarmierDominique GarmierScore: 648,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 08:10647,927265,567,939191,787,00047,946,0002,289,664
2Mar 22, 2026 08:10648,019274,112,218190,815,00048,952,0002,535,424
3Mar 22, 2026 08:10654,559270,422,592192,149,00050,038,0002,301,952