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 listOct 12, 2025 00:40Marco BarboneMarco BarboneScore: 329,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 00:40326,00510,793,905,18510,734,189,00023,980,0002,510,848
2Oct 12, 2025 00:40326,23510,798,179,30310,752,777,00012,991,0002,510,848
3Oct 12, 2025 00:40326,71510,816,067,29410,760,596,00020,985,0002,363,392
4Oct 12, 2025 00:40327,68610,848,566,78210,796,647,00016,986,0002,265,088
5Oct 12, 2025 00:40329,07410,889,784,97710,833,477,00025,981,0002,326,528
6Oct 12, 2025 00:40329,38310,904,483,40510,852,653,00016,986,0002,465,792
7Oct 12, 2025 00:40330,39110,937,718,07810,880,929,00021,985,0002,400,256
8Oct 12, 2025 00:40330,60810,946,953,44010,892,089,00017,988,0002,490,368
9Oct 12, 2025 00:40330,92610,951,384,39710,900,584,00019,986,0002,306,048