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 8, 2025 20:00Rajarshi BasuRajarshi BasuScore: 134,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 20:00131,9974,392,452,9494,336,911,00018,990,0002,420,736
2Dec 8, 2025 20:00132,1804,392,740,0584,349,936,00011,991,0002,461,696
3Dec 8, 2025 20:00132,5174,409,479,1334,357,087,00015,989,0002,420,736
4Dec 8, 2025 20:00132,7954,408,536,6814,368,238,00013,991,0002,506,752
5Dec 8, 2025 20:00134,6194,474,398,4664,423,438,00018,989,0002,433,024
6Dec 8, 2025 20:00135,7564,513,907,5414,460,951,00018,987,0002,482,176
7Dec 8, 2025 20:00135,7584,512,205,0714,463,014,00016,988,0002,306,048
8Dec 8, 2025 20:00135,8024,512,535,9504,470,463,00010,993,0002,510,848
9Dec 8, 2025 20:00136,2204,527,623,2694,476,269,00018,988,0002,314,240