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 listApr 16, 2026 17:25olliecrowolliecrowScore: 538,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 17:25537,716222,497,26422,994,000175,961,0002,379,776
2Apr 16, 2026 17:25538,303222,958,64022,019,000177,153,0002,387,968
3Apr 16, 2026 17:25560,108234,592,09223,026,000184,214,0002,334,720