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 listJul 27, 2025 05:01Serendipity1902Serendipity1902Score: 85,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2025 05:0184,6832,820,491,7072,763,545,00030,983,0002,461,696
2Jul 27, 2025 05:0184,7262,827,625,4752,758,956,00036,986,0002,441,216
3Jul 27, 2025 05:0184,8632,824,344,8982,759,512,00040,977,0002,269,184
4Jul 27, 2025 05:0185,0082,840,480,2492,770,300,00034,978,0002,269,184
5Jul 27, 2025 05:0185,3592,845,832,3222,774,875,00041,967,0002,473,984
6Jul 27, 2025 05:0185,5372,856,653,1042,783,739,00038,982,0002,457,600
7Jul 27, 2025 05:0185,6432,854,815,8352,792,228,00033,978,0002,293,760
8Jul 27, 2025 05:0185,6532,850,445,8542,792,574,00033,982,0002,347,008
9Jul 27, 2025 05:0186,1472,871,791,5392,807,878,00034,973,0002,461,696