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 listOct 17, 2026 01:51e1011e1011Score: 321,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 01:54320,27810,581,083,85110,543,698,00025,483,0002,113,536
2Oct 17, 2026 01:54320,47610,586,806,75210,552,115,00023,602,0002,113,536
3Oct 17, 2026 01:54320,83510,599,041,36110,563,475,00024,099,0002,113,536
4Oct 17, 2026 01:54321,30410,614,629,22410,577,160,00025,881,0002,113,536
5Oct 17, 2026 01:54321,80910,630,738,23210,596,002,00023,714,0002,113,536
6Oct 17, 2026 01:54321,81510,630,928,46210,594,942,00024,979,0002,113,536
7Oct 17, 2026 01:54323,20810,677,007,01110,641,769,00024,121,0002,113,536
8Oct 17, 2026 01:54324,93810,734,466,29010,697,833,00025,133,0002,113,536
9Oct 17, 2026 01:54327,18010,807,884,75810,770,491,00026,468,0002,113,536