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 listDec 8, 2025 19:51Rajarshi BasuRajarshi BasuScore: 148,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 19:51147,3604,895,542,4754,847,878,00014,990,0002,310,144
2Dec 8, 2025 19:51147,8314,905,983,8614,856,435,00021,988,0002,293,760
3Dec 8, 2025 19:51148,7364,938,813,9734,885,289,00022,987,0002,383,872
4Dec 8, 2025 19:51148,7374,933,870,0294,885,343,00022,987,0002,514,944
5Dec 8, 2025 19:51148,7414,939,710,1304,873,477,00034,981,0002,359,296
6Dec 8, 2025 19:51149,2344,952,450,5184,900,751,00023,984,0002,379,776
7Dec 8, 2025 19:51149,2844,960,721,4964,892,386,00033,974,0002,379,776
8Dec 8, 2025 19:51149,5164,966,934,5984,915,052,00018,988,0002,457,600
9Dec 8, 2025 19:51149,8704,980,269,4394,922,730,00022,984,0002,273,280