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 11, 2026 03:16Josu San MartinJosu San MartinScore: 4,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 03:164,377174,953,037142,424,0002,005,0002,289,664
2Jan 11, 2026 03:164,378173,342,603142,463,0002,006,0002,289,664
3Jan 11, 2026 03:164,384172,173,904141,671,0002,993,0002,289,664
4Jan 11, 2026 03:164,384169,963,259143,671,000997,0002,289,664
5Jan 11, 2026 03:164,384173,172,630142,676,0001,995,0002,289,664
6Jan 11, 2026 03:164,385171,537,350142,704,0001,995,0002,396,160
7Jan 11, 2026 03:164,386168,784,998141,739,0002,994,0002,289,664
8Jan 11, 2026 03:164,390166,440,702141,886,0002,997,0002,289,664
9Jan 11, 2026 03:164,391169,460,221143,895,000999,0002,400,256