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:15Dominique GarmierDominique GarmierScore: 69,843Success
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:1569,22449,667,04824,589,0001,024,0002,281,472
2Mar 27, 2026 00:1569,84351,177,80923,855,0001,987,0002,281,472
3Mar 27, 2026 00:1570,03252,076,17023,919,0001,993,0002,281,472