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 listMay 16, 2026 06:27M-RochatM-RochatScore: 93,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 06:2992,3683,057,517,2753,027,260,00020,890,0002,113,536
2May 16, 2026 06:2992,4163,060,629,5663,030,273,00019,461,0002,113,536
3May 16, 2026 06:2992,5843,065,718,0203,035,879,00019,413,0002,113,536
4May 16, 2026 06:2993,0083,080,032,0563,050,712,00018,554,0002,113,536
5May 16, 2026 06:2993,2993,089,617,6173,059,500,00019,369,0002,113,536
6May 16, 2026 06:2993,4493,094,520,2583,065,148,00018,701,0002,113,536
7May 16, 2026 06:2993,9673,110,075,6733,080,468,00020,443,0002,113,536
8May 16, 2026 06:2994,1643,116,948,5033,088,678,00018,739,0002,113,536
9May 16, 2026 06:2994,6613,133,795,9953,104,708,00019,119,0002,113,536