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:32olliecrowolliecrowScore: 24,791Success
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:3323,350792,863,367760,563,0009,994,0002,326,528
2Jan 31, 2026 17:3323,513802,754,812766,939,0008,999,0002,277,376
3Jan 31, 2026 17:3323,640810,492,512769,130,00011,001,0002,318,336
4Jan 31, 2026 17:3024,504831,891,628802,641,0005,997,0002,342,912
5Jan 31, 2026 17:3024,791842,785,510811,107,0006,992,0002,433,024
6Jan 31, 2026 17:3025,915884,287,620848,207,0006,993,0002,277,376
7Jan 31, 2026 17:3230,2361,025,609,406991,797,0005,998,0002,277,376
8Jan 31, 2026 17:3230,3761,027,657,642996,405,0005,996,0002,359,296
9Jan 31, 2026 17:3230,5071,031,456,4331,001,744,0004,998,0002,347,008