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 24, 2025 20:23zielajzielajScore: 3,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2025 20:193,812151,229,895115,808,0009,983,0002,408,448
2Dec 24, 2025 20:243,816151,117,092116,930,0008,994,0002,424,832
3Dec 24, 2025 20:243,825144,943,698115,211,00011,020,0002,375,680
4Dec 24, 2025 20:193,830151,967,374115,358,00011,034,0002,506,752
5Dec 24, 2025 20:233,839149,871,839118,695,0007,979,0002,482,176
6Dec 24, 2025 20:243,839155,090,751116,707,0009,974,0002,392,064
7Dec 24, 2025 20:233,845162,805,956119,879,0006,992,0002,404,352
8Dec 24, 2025 20:193,868155,767,767117,669,0009,972,0002,461,696
9Dec 24, 2025 20:233,899153,756,577118,704,0009,975,0002,408,448