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 listJun 24, 2026 22:53Victor MerckléVictor MerckléScore: 72,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 22:5372,45935,931,60325,524,0001,286,0002,117,632stderr
2Jun 24, 2026 22:5372,50035,895,26725,541,0001,284,0002,117,632stderr
3Jun 24, 2026 22:5372,61336,024,27925,583,0001,284,0002,117,632stderr
4Jun 24, 2026 22:5372,61335,979,68925,845,0001,022,0002,117,632stderr
5Jun 24, 2026 22:5372,63235,961,41625,603,0001,271,0002,117,632stderr
6Jun 24, 2026 22:5372,70836,437,51025,876,0001,026,0002,117,632stderr
7Jun 24, 2026 22:5372,83236,018,72925,660,0001,288,0002,117,632stderr
8Jun 24, 2026 22:5372,86236,037,26425,937,0001,022,0002,117,632stderr
9Jun 24, 2026 22:5372,87836,044,59525,670,0001,295,0002,117,632stderr