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 6, 2026 04:06Karthik ReddyKarthik ReddyScore: 3,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 04:073,955139,530,522128,141,0002,374,00020,480
2Oct 6, 2026 04:073,959139,722,261128,276,0002,382,00020,480
3Oct 6, 2026 04:073,968141,277,755128,581,0002,371,00020,480
4Oct 6, 2026 04:073,970139,993,352128,995,0002,015,00020,480
5Oct 6, 2026 04:073,977140,258,494128,907,0002,359,00020,480
6Oct 6, 2026 04:073,987140,695,657129,207,0002,391,00020,480
7Oct 6, 2026 04:074,037144,485,828131,213,0002,010,00020,480
8Oct 6, 2026 04:074,053142,899,288131,739,0002,013,00020,480
9Oct 6, 2026 04:074,193147,364,262136,010,0002,361,00020,480