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 16, 2026 02:57Victor MerckléVictor MerckléScore: 3,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 02:583,07792,310,892240,126,0003,195,0002,654,208
2Jun 16, 2026 02:583,08292,475,587240,179,0003,157,0002,654,208
3Jun 16, 2026 02:583,09592,869,128241,849,0003,164,0002,654,208
4Jun 16, 2026 02:583,10293,075,161246,115,0001,066,0002,654,208
5Jun 16, 2026 02:583,13394,007,903244,297,0003,211,0002,654,208
6Jun 16, 2026 02:583,15694,702,993244,106,0003,123,0002,654,208
7Jun 16, 2026 02:583,17095,123,087247,035,0001,041,0002,654,208
8Jun 16, 2026 02:583,17195,159,302244,691,0001,052,0002,650,112
9Jun 16, 2026 02:583,20496,126,913245,417,0003,194,0002,654,208