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 listJul 23, 2026 21:32boop34boop34Score: 13,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 21:3313,688461,506,787446,564,0005,149,0002,113,536
2Jul 23, 2026 21:3313,713462,274,958447,375,0005,176,0002,113,536
3Jul 23, 2026 21:3313,721462,687,680447,564,0005,244,0002,113,536
4Jul 23, 2026 21:3313,734463,084,908448,153,0005,101,0002,113,536
5Jul 23, 2026 21:3313,745463,582,043448,255,0005,334,0002,113,536
6Jul 23, 2026 21:3313,747463,518,409448,734,0004,945,0002,113,536
7Jul 23, 2026 21:3313,765464,077,640449,080,0005,189,0002,113,536
8Jul 23, 2026 21:3313,826466,030,059451,248,0005,022,0002,113,536
9Jul 23, 2026 21:3313,848466,766,798451,977,0005,012,0002,113,536