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 listFeb 26, 2025 16:57AdityaAdityaScore: 173,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2025 16:57171,5215,690,899,5955,629,219,00030,979,0002,330,624
2Feb 26, 2025 16:57171,8845,698,562,4605,642,197,00029,979,0002,351,104
3Feb 26, 2025 16:57172,3955,721,909,7225,660,041,00028,984,0002,469,888
4Feb 26, 2025 16:57172,5435,731,711,1545,669,953,00023,982,0002,289,664
5Feb 26, 2025 16:57173,2645,754,116,7275,694,716,00022,986,0002,392,064
6Feb 26, 2025 16:57173,6045,760,269,9855,695,964,00032,982,0002,347,008
7Feb 26, 2025 16:57173,6915,765,244,2235,701,826,00029,983,0002,342,912
8Feb 26, 2025 16:57174,0955,771,116,5955,719,139,00025,982,0002,478,080
9Feb 26, 2025 16:57174,4765,788,865,0025,727,737,00029,982,0002,277,376