Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listSep 1, 2026 11:07Victor MerckléVictor MerckléScore: 1,779Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 11:081,73652,107,816124,301,0002,265,0002,170,880stderr
2Sep 1, 2026 11:081,75552,660,959125,695,0002,033,0002,170,880stderr
3Sep 1, 2026 11:081,76753,025,870126,243,0002,036,0002,170,880stderr
4Sep 1, 2026 11:081,77553,268,984125,952,0002,014,0002,170,880stderr
5Sep 1, 2026 11:081,77953,381,024126,479,0001,034,0002,170,880stderr
6Sep 1, 2026 11:081,78553,559,482126,439,0001,037,0002,170,880stderr
7Sep 1, 2026 11:081,79753,910,418128,278,0001,021,0002,170,880stderr
8Sep 1, 2026 11:081,79853,951,695127,518,0001,035,0002,170,880stderr
9Sep 1, 2026 11:081,82354,710,286126,051,0002,035,0002,170,880stderr