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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 23:013,715111,478,333297,046,0002,187,0002,146,304
2Jun 9, 2026 23:013,725111,764,238297,111,0002,196,0002,142,208
3Jun 9, 2026 23:013,732111,980,083298,023,0002,195,0002,142,208
4Jun 9, 2026 23:013,735112,061,949299,080,0001,077,0002,142,208
5Jun 9, 2026 23:013,741112,240,003300,392,0001,005,0002,142,208
6Jun 9, 2026 23:013,770113,108,517298,926,0002,212,0002,142,208
7Jun 9, 2026 23:013,779113,395,994303,501,0001,007,0002,142,208
8Jun 9, 2026 23:013,783113,515,013298,842,0002,280,0002,146,304
9Jun 9, 2026 23:013,798113,949,932303,731,0001,069,0002,142,208