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 15:03Rajarshi BasuRajarshi BasuScore: 26,525Success
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 15:0326,203894,355,624856,715,0007,997,0002,457,600
2Dec 11, 2025 15:0326,311895,125,493859,261,0008,992,0002,334,720
3Dec 11, 2025 15:0326,392898,180,057859,934,00010,999,0002,424,832
4Dec 11, 2025 15:0326,471900,948,511863,565,0009,994,0002,469,888
5Dec 11, 2025 15:0326,525906,177,143862,348,00012,990,0002,506,752
6Dec 11, 2025 15:0326,565904,068,089864,637,00011,994,0002,293,760
7Dec 11, 2025 15:0326,647911,291,089871,346,0007,994,0002,428,928
8Dec 11, 2025 15:0326,656911,588,361869,640,0009,995,0002,510,848
9Dec 11, 2025 15:0327,082921,340,799882,710,00010,996,0002,375,680