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 9, 2026 19:30Josu San MartinJosu San MartinScore: 6,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 19:126,181236,103,838196,960,0006,998,0002,469,888
2Jan 9, 2026 19:316,183230,986,079199,033,0005,000,0002,379,776
3Jan 9, 2026 19:126,187225,818,152198,176,0006,005,0002,506,752
4Jan 9, 2026 19:316,188231,707,494199,193,0005,004,0002,359,296
5Jan 9, 2026 19:306,189234,479,861201,218,0003,003,0002,494,464
6Jan 9, 2026 19:306,197233,033,469198,527,0005,985,0002,383,872
7Jan 9, 2026 19:126,222232,676,722201,322,0004,006,0002,383,872
8Jan 9, 2026 19:316,223233,655,077201,347,0004,006,0002,482,176
9Jan 9, 2026 19:306,246230,953,925203,119,0003,001,0002,277,376