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 listNov 15, 2025 22:19Aniruddha DebAniruddha DebScore: 13,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2025 22:1913,426474,633,038410,123,00032,929,0002,310,144
2Nov 15, 2025 22:1913,427471,691,579413,149,00029,938,0002,334,720
3Nov 15, 2025 22:1913,454473,208,608399,094,00044,898,0002,400,256
4Nov 15, 2025 22:1913,478472,686,539407,877,00036,898,0002,486,272
5Nov 15, 2025 22:1913,481474,324,469403,977,00040,896,0002,314,240
6Nov 15, 2025 22:1913,538477,153,438410,869,00035,901,0002,347,008
7Nov 15, 2025 22:1913,543475,679,253413,991,00032,919,0002,363,392
8Nov 15, 2025 22:1913,599480,611,679415,866,00032,910,0002,465,792
9Nov 15, 2025 22:1914,334497,443,292440,099,00032,932,0002,318,336