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 13, 2026 13:00Victor MerckléVictor MerckléScore: 3,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 13:023,17495,249,125244,487,0003,296,0002,699,264
2Jun 13, 2026 13:023,18195,446,775242,703,0004,371,0002,699,264
3Jun 13, 2026 13:023,18595,575,387243,336,0003,121,0002,699,264
4Jun 13, 2026 13:023,21296,378,711245,143,0003,256,0002,699,264
5Jun 13, 2026 13:023,23296,968,200245,652,0003,190,0002,695,168
6Jun 13, 2026 13:023,25297,561,744243,774,0003,339,0002,695,168
7Jun 13, 2026 13:023,26197,845,257244,604,0003,255,0002,699,264
8Jun 13, 2026 13:023,27898,351,531246,026,0003,321,0002,699,264
9Jun 13, 2026 13:023,30299,087,871248,563,0003,290,0002,699,264