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 2, 2026 03:37Genos0Genos0Score: 201,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 03:39201,0216,643,809,9226,585,103,00048,618,0002,113,536
2Jul 2, 2026 03:39201,0256,644,183,8956,582,903,00050,927,0002,113,536
3Jul 2, 2026 03:39201,0936,646,112,4846,578,494,00057,584,0002,113,536
4Jul 2, 2026 03:39201,3966,655,965,6696,597,263,00048,816,0002,113,536
5Jul 2, 2026 03:39201,7436,667,291,4816,608,267,00049,255,0002,113,536
6Jul 2, 2026 03:39201,7576,667,724,1936,607,965,00050,016,0002,113,536
7Jul 2, 2026 03:39202,8296,703,504,3976,643,405,00049,982,0002,113,536
8Jul 2, 2026 03:39202,9116,705,837,0416,646,674,00049,394,0002,113,536
9Jul 2, 2026 03:39203,3346,719,833,9946,660,607,00049,427,0002,113,536