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 18, 2026 01:09Josu San MartinJosu San MartinScore: 9,133Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 01:084,307170,415,100140,116,0002,001,0002,289,664
2Jan 18, 2026 01:084,308167,718,281141,173,0001,001,0002,396,160
3Jan 18, 2026 01:084,783192,558,895156,855,000999,0002,404,352
4Jan 18, 2026 01:099,102327,576,262298,379,0001,995,0002,289,664
5Jan 18, 2026 01:099,133327,762,625298,382,0002,993,0002,502,656
6Jan 18, 2026 01:099,148323,713,006300,876,000999,0002,289,664
7Jan 18, 2026 01:0916,593570,905,557541,570,0005,995,0002,277,376
8Jan 18, 2026 01:0916,785576,804,089546,894,0006,998,0002,379,776
9Jan 18, 2026 01:0916,829583,053,066549,366,0005,993,0002,260,992