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 listAug 12, 2025 21:53Leon ZhaoLeon ZhaoScore: 17,162Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 21:5316,998592,506,824514,949,00045,995,0002,334,720
2Aug 12, 2025 21:5317,012592,795,890504,458,00056,938,0002,408,448
3Aug 12, 2025 21:5317,085593,868,216510,812,00052,980,0002,408,448
4Aug 12, 2025 21:5317,114596,517,427506,783,00057,975,0002,404,352
5Aug 12, 2025 21:5317,162594,055,078512,409,00053,937,0002,383,872
6Aug 12, 2025 21:5317,273594,016,483508,113,00061,892,0002,486,272
7Aug 12, 2025 21:5317,305603,406,969517,168,00053,913,0002,478,080
8Aug 12, 2025 21:5317,354606,058,051525,704,00046,973,0002,379,776
9Aug 12, 2025 21:5317,377599,995,818518,492,00054,946,0002,473,984