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 16, 2025 01:56Ian MckibbenIan MckibbenScore: 28,979Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 01:5628,903981,499,736876,822,00076,984,0002,281,472
2Jan 16, 2025 01:5628,953984,866,618860,500,00094,944,0002,371,584
3Jan 16, 2025 01:5628,961979,678,494867,745,00087,974,0002,400,256
4Jan 16, 2025 01:5628,978979,156,248876,339,00079,939,0002,412,544
5Jan 16, 2025 01:5628,979978,346,408865,386,00090,935,0002,281,472
6Jan 16, 2025 01:5629,048984,681,361880,605,00077,965,0002,445,312
7Jan 16, 2025 01:5629,078987,475,058877,620,00081,964,0002,396,160
8Jan 16, 2025 01:5629,110982,852,037875,662,00084,967,0002,281,472
9Jan 16, 2025 01:5629,122986,710,621885,098,00075,922,0002,392,064