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 12:19Rajarshi BasuRajarshi BasuScore: 53,509Success
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 12:1953,2021,793,063,3441,745,687,0009,992,0002,310,144
2Dec 11, 2025 12:1953,3971,788,294,7341,752,098,0009,994,0002,510,848
3Dec 11, 2025 12:1953,3971,791,759,8971,753,111,0008,995,0002,486,272
4Dec 11, 2025 12:1953,5061,795,963,2621,750,723,00014,989,0002,392,064
5Dec 11, 2025 12:1953,5091,794,172,6621,753,799,00011,991,0002,437,120
6Dec 11, 2025 12:1953,7311,798,707,9631,763,119,0009,995,0002,396,160
7Dec 11, 2025 12:1954,5861,827,889,2051,791,350,0009,990,0002,408,448
8Dec 11, 2025 12:1956,0321,879,575,1821,839,078,0009,989,0002,404,352
9Dec 11, 2025 12:1956,2661,889,338,9811,845,789,00010,992,0002,433,024