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 listNov 6, 2025 07:29izotoffizotoffScore: 237,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2025 07:29235,0897,784,260,5097,605,051,000152,900,0002,363,392
2Nov 6, 2025 07:29236,1757,824,165,8247,627,881,000165,888,0002,519,040
3Nov 6, 2025 07:29236,2297,824,976,9547,648,666,000146,897,0002,523,136
4Nov 6, 2025 07:29236,5767,834,514,9257,653,123,000153,901,0002,445,312
5Nov 6, 2025 07:29237,2827,863,393,9297,657,435,000172,874,0002,269,184
6Nov 6, 2025 07:29237,5017,872,803,7787,695,614,000141,919,0002,400,256
7Nov 6, 2025 07:29237,5567,869,491,4097,718,433,000120,928,0002,273,280
8Nov 6, 2025 07:29239,1627,922,980,3907,736,462,000155,888,0002,330,624
9Nov 6, 2025 07:29239,7927,943,063,6517,745,268,000167,875,0002,379,776