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 listAug 17, 2026 00:23Victor MerckléVictor MerckléScore: 2,154Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 00:352,13063,920,718160,287,0001,231,0002,170,880stderr
2Aug 17, 2026 00:352,13364,006,038160,517,0001,222,0002,170,880stderr
3Aug 17, 2026 00:352,13564,058,063160,624,0001,242,0002,170,880stderr
4Aug 17, 2026 00:352,15064,516,365161,009,0001,075,0002,170,880stderr
5Aug 17, 2026 00:352,15464,633,314159,363,0001,216,0002,170,880stderr
6Aug 17, 2026 00:352,15964,793,300159,018,0001,244,0002,170,880stderr
7Aug 17, 2026 00:352,16464,937,318161,354,0001,230,0002,170,880stderr
8Aug 17, 2026 00:352,16464,930,918160,469,0001,003,0002,170,880stderr
9Aug 17, 2026 00:352,18265,480,368161,985,0001,005,0002,170,880stderr