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:13Victor MerckléVictor MerckléScore: 3,090Success
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:143,04991,495,497241,645,0001,023,0002,641,920
2Jun 18, 2026 17:143,05891,763,608240,439,0001,024,0002,641,920
3Jun 18, 2026 17:143,07192,151,201239,657,0003,031,0002,641,920
4Jun 18, 2026 17:143,08792,625,649241,418,0003,066,0002,641,920
5Jun 18, 2026 17:143,09092,711,066241,810,0003,056,0002,641,920
6Jun 18, 2026 17:143,09692,888,360241,647,0003,079,0002,641,920
7Jun 18, 2026 17:143,09992,988,785244,499,0001,017,0002,641,920
8Jun 18, 2026 17:143,10593,150,008242,412,0003,149,0002,641,920
9Jun 18, 2026 17:143,15594,670,642246,140,00002,641,920