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 31, 2026 01:00Andrew EpsteinAndrew EpsteinScore: 2,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 01:032,731100,611,92088,884,0001,242,0002,117,632
2Oct 31, 2026 01:032,73699,634,43789,042,0001,251,0002,113,536
3Oct 31, 2026 01:032,73899,650,94989,107,0001,273,0002,113,536
4Oct 31, 2026 01:032,751100,047,41489,636,0001,168,0002,113,536
5Oct 31, 2026 01:032,763100,546,35089,911,0001,269,0002,113,536
6Oct 31, 2026 01:032,781102,747,31190,512,0001,287,0002,113,536
7Oct 31, 2026 01:032,786101,297,11190,706,0001,251,0002,113,536
8Oct 31, 2026 01:033,335128,414,682109,055,0001,023,0002,113,536
9Oct 31, 2026 01:033,384131,747,680110,670,0001,013,0002,113,536