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 12, 2026 21:13Adam FolwarcznyAdam FolwarcznyScore: 97,935Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 21:1397,3343,246,892,8583,199,016,00012,991,0002,293,760
2Jan 12, 2026 21:1397,5783,246,363,6133,208,094,00011,992,0002,510,848
3Jan 12, 2026 21:1397,6643,252,592,6773,213,913,0008,996,0002,310,144
4Jan 12, 2026 21:1397,9023,263,757,0703,216,787,00013,990,0002,318,336
5Jan 12, 2026 21:1397,9353,259,381,5173,220,859,00010,996,0002,519,040
6Jan 12, 2026 21:1397,9553,265,911,3953,217,530,00014,993,0002,318,336
7Jan 12, 2026 21:1398,5073,285,074,5653,240,737,0009,996,0002,318,336
8Jan 12, 2026 21:1398,8443,296,433,1013,250,860,00010,992,0002,519,040
9Jan 12, 2026 21:13100,3333,340,960,0003,298,992,00011,992,0002,519,040