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 18, 2026 17:36Victor MerckléVictor MerckléScore: 3,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 17:373,08792,621,672242,827,0003,027,0002,654,208
2Jun 18, 2026 17:373,11493,433,318242,179,0003,110,0002,654,208
3Jun 18, 2026 17:373,11493,422,541242,019,0003,109,0002,654,208
4Jun 18, 2026 17:373,12193,655,648244,581,0001,018,0002,654,208
5Jun 18, 2026 17:373,12193,654,377244,343,0003,148,0002,654,208
6Jun 18, 2026 17:373,13293,988,129244,195,0003,139,0002,408,448
7Jun 18, 2026 17:373,17495,222,500244,354,0003,062,0002,654,208
8Jun 18, 2026 17:373,18095,406,795246,028,0003,044,0002,654,208
9Jun 18, 2026 17:373,23296,988,091247,026,0003,082,0002,654,208