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 listMay 24, 2025 15:09Emanuele BolognesiEmanuele BolognesiScore: 57,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2025 15:0953,2261,788,881,7521,749,456,0006,997,0002,281,472
2May 24, 2025 15:0953,5941,797,509,3831,756,605,00011,997,0002,318,336
3May 24, 2025 15:0954,7201,839,439,0761,788,767,00016,988,0002,506,752
4May 24, 2025 15:0955,5731,859,934,4501,822,913,00010,993,0002,293,760
5May 24, 2025 15:0957,1871,916,221,9451,871,183,00015,993,0002,334,720
6May 24, 2025 15:0957,2191,914,629,5741,878,236,0009,995,0002,265,088
7May 24, 2025 15:0957,2361,922,230,3321,870,805,00017,988,0002,523,136
8May 24, 2025 15:0957,2861,925,370,8391,882,455,0007,997,0002,486,272
9May 24, 2025 15:0957,3901,920,896,2091,884,875,0008,994,0002,506,752