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 listSep 26, 2025 11:27Wookyung JeongWookyung JeongScore: 108,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 11:27108,1013,594,646,8293,441,395,000125,941,0002,363,392
2Sep 26, 2025 11:27108,1753,595,098,6663,447,864,000121,924,0002,277,376
3Sep 26, 2025 11:27108,3593,600,070,1653,450,914,000124,924,0002,277,376
4Sep 26, 2025 11:27108,4233,611,074,0793,457,037,000120,931,0002,416,640
5Sep 26, 2025 11:27108,9413,621,961,9173,465,111,000129,929,0002,453,504
6Sep 26, 2025 11:27109,0833,627,888,4123,477,822,000121,923,0002,437,120
7Sep 26, 2025 11:27109,1173,635,647,4233,476,920,000123,925,0002,277,376
8Sep 26, 2025 11:27109,1173,629,427,7913,473,922,000126,924,0002,498,560
9Sep 26, 2025 11:27109,6763,647,673,3543,501,398,000117,912,0002,330,624