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 listSep 26, 2025 11:59Wookyung JeongWookyung JeongScore: 96,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 11:5995,4133,181,438,0923,045,703,000102,922,0002,375,680
2Sep 26, 2025 11:5995,7883,192,799,4723,047,066,000113,927,0002,404,352
3Sep 26, 2025 11:5995,8413,191,299,9613,040,851,000121,913,0002,379,776
4Sep 26, 2025 11:5996,2983,204,803,0403,079,904,00097,933,0002,277,376
5Sep 26, 2025 11:5996,4283,215,165,8553,074,197,000107,936,0002,371,584
6Sep 26, 2025 11:5996,7683,218,149,7153,079,390,000113,940,0002,396,160