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 listFeb 16, 2023 17:18LiamLiamScore: 357,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2023 17:16352,56211,698,694,56611,634,536,95402,306,048
2Feb 16, 2023 17:18352,91011,701,250,84111,646,018,82502,277,376
3Feb 16, 2023 17:16354,30911,762,102,00411,692,181,18402,248,704
4Feb 16, 2023 17:18357,55911,871,924,23211,799,436,42502,211,840
5Feb 16, 2023 17:16357,82211,873,746,55211,808,112,63102,269,184
6Feb 16, 2023 17:18361,40211,997,453,67311,926,281,94802,220,032