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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 09:117,916290,241,410252,205,0009,007,0002,461,696
2Dec 19, 2025 09:117,928285,264,025252,626,0008,986,0002,506,752
3Dec 19, 2025 09:117,933287,679,079254,783,0006,994,0002,441,216
4Dec 19, 2025 09:117,947290,119,085255,245,0007,006,0002,453,504
5Dec 19, 2025 09:117,954290,734,767256,500,0005,988,0002,383,872
6Dec 19, 2025 09:117,991288,133,714259,706,0003,995,0002,437,120
7Dec 19, 2025 09:118,002287,962,974256,079,0008,002,0002,277,376
8Dec 19, 2025 09:118,110295,838,941258,653,0008,987,0002,453,504
9Dec 19, 2025 09:118,119290,736,808259,932,0007,997,0002,306,048