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 18, 2026 03:35Josu San MartinJosu San MartinScore: 4,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 03:444,748142,451,759199,045,0003,230,0002,158,592
2Aug 18, 2026 03:444,755142,656,627199,191,0003,212,0002,158,592
3Aug 18, 2026 03:444,763142,890,307198,609,0003,212,0002,236,416
4Aug 18, 2026 03:444,766142,988,313199,324,0003,210,0002,158,592
5Aug 18, 2026 03:444,767143,027,378199,737,0003,223,0002,158,592
6Aug 18, 2026 03:444,770143,129,337199,518,0003,143,0002,158,592
7Aug 18, 2026 03:444,776143,302,472199,921,0003,241,0002,158,592
8Aug 18, 2026 03:444,777143,327,231199,153,0003,240,0002,158,592
9Aug 18, 2026 03:444,793143,807,878199,387,0003,217,0002,158,592