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 listJan 10, 2025 23:58Ian MckibbenIan MckibbenScore: 86,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2025 23:5885,9072,864,156,3382,808,940,00025,980,0002,351,104
2Jan 10, 2025 23:5886,1442,872,161,8162,816,788,00025,979,0002,318,336
3Jan 10, 2025 23:5886,2232,868,659,7662,816,372,00028,983,0002,453,504
4Jan 10, 2025 23:5886,3672,884,124,0862,824,128,00025,982,0002,408,448
5Jan 10, 2025 23:5886,6552,890,462,8802,838,618,00020,989,0002,379,776
6Jan 10, 2025 23:5886,6802,888,922,4902,835,457,00024,986,0002,473,984
7Jan 10, 2025 23:5886,8232,890,206,9672,844,180,00020,986,0002,404,352
8Jan 10, 2025 23:5887,5302,918,615,2732,863,488,00024,986,0002,445,312
9Jan 10, 2025 23:5887,5382,914,618,7542,869,754,00018,991,0002,445,312