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 16, 2026 22:00izotoffizotoffScore: 124,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 22:00123,87675,223,11045,834,00002,314,240
2Mar 16, 2026 22:00124,04971,311,05043,903,0001,995,0002,314,240
3Mar 16, 2026 22:00124,44377,280,82144,043,0002,001,0002,387,968