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 20, 2025 03:19Cyril SharmaCyril SharmaScore: 25,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2025 03:1925,032851,305,021796,067,00030,002,0002,400,256
2Jul 20, 2025 03:1925,077849,756,467802,562,00024,986,0002,396,160
3Jul 20, 2025 03:1925,149854,583,404798,915,00030,996,0002,392,064
4Jul 20, 2025 03:1925,239862,023,352802,893,00029,996,0002,506,752
5Jul 20, 2025 03:1925,271863,833,087801,932,00031,997,0002,330,624
6Jul 20, 2025 03:1925,283859,355,513805,371,00028,977,0002,285,568
7Jul 20, 2025 03:1925,317866,276,221807,493,00027,982,0002,400,256
8Jul 20, 2025 03:1925,359868,727,654804,855,00031,994,0002,277,376
9Jul 20, 2025 03:1925,430866,108,505807,209,00031,968,0002,400,256