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 listJan 15, 2026 21:42Adam FolwarcznyAdam FolwarcznyScore: 13,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 21:4213,537474,413,263427,720,00018,987,0002,371,584
2Jan 15, 2026 21:4213,614476,140,588432,238,00017,009,0002,482,176
3Jan 15, 2026 21:4213,622477,103,609431,539,00017,980,0002,371,584
4Jan 15, 2026 21:4213,681478,657,971437,493,00013,983,0002,392,064
5Jan 15, 2026 21:4213,782473,790,728439,810,00014,993,0002,297,856
6Jan 15, 2026 21:4213,799481,104,100442,391,00012,982,0002,437,120
7Jan 15, 2026 21:4213,891480,822,829442,436,00015,979,0002,510,848
8Jan 15, 2026 21:4213,899486,216,917443,663,00014,988,0002,424,832
9Jan 15, 2026 21:4213,927484,841,543442,616,00016,985,0002,371,584