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 listAug 2, 2026 06:33Victor MerckléVictor MerckléScore: 57,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 06:3456,84029,157,73320,011,0001,020,0002,113,536
2Aug 2, 2026 06:3456,87529,163,41320,020,0001,024,0002,113,536
3Aug 2, 2026 06:3456,89129,218,02620,025,0001,025,0002,113,536
4Aug 2, 2026 06:3456,98130,175,83720,077,0001,006,0002,113,536
5Aug 2, 2026 06:3457,00029,272,17220,058,0001,032,0002,113,536
6Aug 2, 2026 06:3457,06729,514,79320,094,0001,021,0002,113,536
7Aug 2, 2026 06:3457,07529,549,51920,090,0001,028,0002,113,536
8Aug 2, 2026 06:3457,10529,491,46020,118,0001,011,0002,113,536
9Aug 2, 2026 06:3457,14329,266,44520,102,0001,041,0002,113,536