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 listNov 3, 2025 07:33vonqovonqoScore: 318,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2025 07:33316,46210,479,060,03710,334,329,000108,929,0002,293,760
2Nov 3, 2025 07:33316,62410,485,848,30010,342,663,000105,914,0002,310,144
3Nov 3, 2025 07:33317,13310,495,594,60210,372,445,00092,941,0002,461,696
4Nov 3, 2025 07:33317,28010,508,036,62010,361,336,000108,919,0002,396,160
5Nov 3, 2025 07:33318,03410,531,761,83610,397,191,00097,935,0002,404,352
6Nov 3, 2025 07:33318,18910,536,600,33210,400,293,00099,935,0002,392,064
7Nov 3, 2025 07:33318,99010,566,293,02210,425,743,000100,929,0002,359,296
8Nov 3, 2025 07:33320,51610,614,225,39710,477,083,00099,934,0002,404,352
9Nov 3, 2025 07:33323,93110,724,870,22310,576,816,000112,912,0002,310,144