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 listDec 27, 2025 21:00Josu San MartinJosu San MartinScore: 21,933Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 21:0021,828740,720,082704,352,00015,985,0002,363,392
2Dec 27, 2025 21:0021,866752,780,651703,596,00017,989,0002,297,856
3Dec 27, 2025 21:0021,878747,466,736708,980,00012,999,0002,273,280
4Dec 27, 2025 21:0021,886755,921,078704,234,00018,005,0002,297,856
5Dec 27, 2025 21:0021,933745,579,896707,809,00015,995,0002,486,272
6Dec 27, 2025 21:0021,981751,135,591705,386,00019,982,0002,289,664
7Dec 27, 2025 21:0022,000755,620,452714,000,00012,000,0002,396,160
8Dec 27, 2025 21:0022,079758,774,454710,626,00017,990,0002,277,376
9Dec 27, 2025 21:0022,883781,471,063739,163,00015,981,0002,285,568