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 10, 2026 06:46Josu San MartinJosu San MartinScore: 5,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 06:465,362201,893,676172,936,0003,998,0002,375,680
2Jan 10, 2026 06:465,370206,112,058172,207,0005,006,0002,379,776
3Jan 10, 2026 06:465,381199,660,447172,582,0004,987,0002,273,280
4Jan 10, 2026 06:465,385198,822,328172,703,0004,991,0002,273,280
5Jan 10, 2026 06:465,403205,211,546174,302,0004,006,0002,498,560
6Jan 10, 2026 06:465,415205,416,898173,705,0004,991,0002,342,912
7Jan 10, 2026 06:465,419201,212,079174,845,0003,996,0002,359,296
8Jan 10, 2026 06:465,503202,048,287177,617,0003,991,0002,383,872
9Jan 10, 2026 06:465,555221,523,280182,318,0001,001,0002,519,040