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 31, 2026 17:16olliecrowolliecrowScore: 20,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 17:1620,771716,106,151669,468,00015,987,0002,322,432
2Jan 31, 2026 17:1620,809708,899,009671,715,00014,993,0002,379,776
3Jan 31, 2026 17:1620,813713,874,883679,833,0006,998,0002,293,760
4Jan 31, 2026 17:1620,863720,153,005672,496,00015,988,0002,461,696
5Jan 31, 2026 17:1620,940719,127,204677,007,00014,000,0002,322,432
6Jan 31, 2026 17:1621,044720,365,557683,460,00010,991,0002,396,160
7Jan 31, 2026 17:1621,125724,588,974684,124,00013,002,0002,297,856
8Jan 31, 2026 17:1621,339734,526,306690,197,00013,983,0002,301,952
9Jan 31, 2026 17:1621,518738,252,916694,101,00015,979,0002,281,472