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 listAug 13, 2025 00:46Leon ZhaoLeon ZhaoScore: 15,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2025 00:4615,531537,532,861499,540,00012,988,0002,363,392
2Aug 13, 2025 00:4615,556540,732,354503,350,0009,987,0002,318,336
3Aug 13, 2025 00:4615,570545,044,520498,853,00014,965,0002,289,664
4Aug 13, 2025 00:4615,603550,704,926503,922,00010,976,0002,420,736
5Aug 13, 2025 00:4615,611543,928,104501,155,00014,004,0002,396,160
6Aug 13, 2025 00:4615,612540,363,079503,202,00011,981,0002,506,752
7Aug 13, 2025 00:4615,631547,332,432504,839,00010,974,0002,437,120
8Aug 13, 2025 00:4615,633539,461,957503,886,00011,997,0002,322,432
9Aug 13, 2025 00:4615,657546,541,197503,683,00012,991,0002,453,504