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:54Rajarshi BasuRajarshi BasuScore: 21,354Success
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:5421,141721,759,400683,663,00013,993,0002,273,280
2Dec 11, 2025 15:5421,193726,966,079681,378,00017,983,0002,482,176
3Dec 11, 2025 15:5421,193734,219,992686,374,00012,988,0002,392,064
4Dec 11, 2025 15:5421,309733,272,240684,220,00018,978,0002,277,376
5Dec 11, 2025 15:5421,354731,393,196688,698,00015,992,0002,437,120
6Dec 11, 2025 15:5421,403733,306,485692,315,00013,986,0002,457,600
7Dec 11, 2025 15:5421,425738,638,172691,033,00015,977,0002,412,544
8Dec 11, 2025 15:5421,649741,632,198698,415,00015,986,0002,502,656
9Dec 11, 2025 15:5423,293793,615,379751,710,00016,970,0002,375,680