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 21, 2025 00:55izotoffizotoffScore: 26,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2025 00:5525,829877,718,165845,364,0006,994,0002,412,544
2Nov 21, 2025 00:5526,125892,254,263855,117,0007,009,0002,453,504
3Nov 21, 2025 00:5526,725909,643,389877,920,0003,999,0002,412,544
4Nov 21, 2025 00:5526,746912,361,866879,608,0002,998,0002,486,272
5Nov 21, 2025 00:5526,790909,531,165879,054,0005,000,0002,473,984
6Nov 21, 2025 00:5526,838915,963,973880,664,0004,998,0002,404,352
7Nov 21, 2025 00:5527,024916,648,394882,794,0008,997,0002,392,064
8Nov 21, 2025 00:5527,155926,696,466889,133,0006,993,0002,420,736
9Nov 21, 2025 00:5527,270930,807,522894,900,0004,999,0002,400,256