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 11, 2025 19:19Rajarshi BasuRajarshi BasuScore: 15,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 19:1915,571537,427,420494,841,00018,993,0002,281,472
2Dec 11, 2025 19:1915,688554,104,284500,723,00016,990,0002,437,120
3Dec 11, 2025 19:1915,704547,572,276494,210,00024,010,0002,408,448
4Dec 11, 2025 19:1915,714548,159,326496,572,00021,981,0002,379,776
5Dec 11, 2025 19:1915,715548,017,294498,626,00019,985,0002,281,472
6Dec 11, 2025 19:1915,768548,800,152500,325,00020,013,0002,396,160
7Dec 11, 2025 19:1915,849553,579,304504,013,00019,000,0002,457,600
8Dec 11, 2025 19:1915,998567,558,486509,945,00017,998,0002,297,856
9Dec 11, 2025 19:1916,124556,900,145511,119,00020,963,0002,281,472