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 listFeb 13, 2026 10:56FuroremFuroremScore: 260,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2026 10:56260,0418,614,720,3328,481,426,00099,934,0002,379,776
2Feb 13, 2026 10:56260,5528,627,726,5938,496,285,000101,931,0002,330,624
3Feb 13, 2026 10:56260,6758,636,034,2658,492,333,000109,926,0002,277,376
4Feb 13, 2026 10:56260,6928,636,353,5328,487,931,000114,917,0002,412,544
5Feb 13, 2026 10:56260,8208,638,096,7518,501,124,000105,939,0002,486,272
6Feb 13, 2026 10:56261,8168,669,240,5158,538,977,000100,940,0002,461,696
7Feb 13, 2026 10:56261,8198,676,329,6638,554,089,00085,940,0002,428,928
8Feb 13, 2026 10:56263,1368,715,736,3958,577,548,000105,932,0002,355,200
9Feb 13, 2026 10:56263,4708,727,482,0138,567,600,000126,920,0002,437,120