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 23, 2025 09:27Adam FolwarcznyAdam FolwarcznyScore: 490,971Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2025 09:27487,21316,119,449,82515,979,088,00098,932,0002,461,696
2Aug 23, 2025 09:27489,31716,187,318,19516,055,532,00091,940,0002,416,640
3Aug 23, 2025 09:27490,50016,220,205,01316,074,552,000111,934,0002,297,856
4Aug 23, 2025 09:27490,77216,233,725,86016,114,522,00080,952,0002,420,736
5Aug 23, 2025 09:27490,97116,238,620,01216,119,087,00082,954,0002,318,336
6Aug 23, 2025 09:27490,98016,240,280,21816,115,382,00086,942,0002,506,752
7Aug 23, 2025 09:27491,19116,245,551,38816,104,369,000104,937,0002,371,584
8Aug 23, 2025 09:27493,67716,324,491,59916,198,401,00092,939,0002,379,776
9Aug 23, 2025 09:27493,92716,332,815,45416,198,647,000100,935,0002,510,848