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 24, 2026 01:12Dominique GarmierDominique GarmierScore: 1,237,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 01:121,232,970481,028,226282,123,000174,076,0002,293,760
2Mar 24, 2026 01:121,237,573483,274,063280,940,000176,962,0002,330,624
3Mar 24, 2026 01:121,238,724483,035,546282,586,000175,742,0002,445,312