Unique strings Sergey Svistunov

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 listJan 12, 2026 01:45Josu San MartinJosu San MartinScore: 4,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 01:444,513171,952,537146,930,0001,999,0002,289,664
2Jan 12, 2026 01:454,513177,234,223146,943,0001,999,0002,396,160
3Jan 12, 2026 01:454,515172,009,440146,985,0001,999,0002,396,160
4Jan 12, 2026 01:454,517177,009,249147,074,0002,001,0002,289,664
5Jan 12, 2026 01:444,518174,448,515147,094,0002,001,0002,289,664
6Jan 12, 2026 01:444,518173,579,536147,104,0002,001,0002,408,448
7Jan 12, 2026 01:454,519174,549,355146,132,0003,002,0002,404,352
8Jan 12, 2026 01:454,535179,691,454147,661,0001,995,0002,289,664
9Jan 12, 2026 01:454,539182,798,384147,779,0001,997,0002,289,664