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 22, 2025 01:56Gerard SmitGerard SmitScore: 161,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 01:56159,2855,293,198,1035,233,420,00022,984,0002,310,144
2Jan 22, 2025 01:56159,6005,294,154,5725,238,807,00027,982,0002,375,680
3Jan 22, 2025 01:56160,0705,315,669,5955,256,314,00025,986,0002,367,488
4Jan 22, 2025 01:56160,1725,311,361,5695,256,701,00028,981,0002,465,792
5Jan 22, 2025 01:56161,3655,360,510,5975,299,044,00025,985,0002,392,064
6Jan 22, 2025 01:56161,8085,369,214,4935,318,685,00020,986,0002,539,520
7Jan 22, 2025 01:56162,2455,387,682,4635,326,097,00027,984,0002,351,104
8Jan 22, 2025 01:56162,4895,396,271,8975,336,142,00025,986,0002,392,064
9Jan 22, 2025 01:56165,2545,480,880,6795,427,387,00025,982,0002,490,368