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 listJun 24, 2026 04:34Victor MerckléVictor MerckléScore: 3,311Success
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 04:353,24297,264,194255,587,0003,066,0002,654,208
2Jun 24, 2026 04:353,28998,682,652260,082,0003,131,0002,654,208
3Jun 24, 2026 04:353,29298,760,939260,137,0003,162,0002,654,208
4Jun 24, 2026 04:353,29898,954,781259,427,0003,113,0002,654,208
5Jun 24, 2026 04:353,31199,331,240261,230,0002,997,0002,650,112
6Jun 24, 2026 04:353,32599,765,665261,734,0003,161,0002,654,208
7Jun 24, 2026 04:353,333100,015,109262,298,0003,113,0002,646,016
8Jun 24, 2026 04:353,380101,401,724263,395,0003,096,0002,654,208
9Jun 24, 2026 04:353,416102,503,550262,889,0003,140,0002,654,208