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 22:47e1011e1011Score: 38,741Success
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 22:4938,5071,281,781,2361,261,230,0009,520,0002,113,536
2Oct 17, 2026 22:4938,5521,283,734,7391,262,710,0009,535,0002,113,536
3Oct 17, 2026 22:4938,5911,284,988,5001,263,825,0009,690,0002,113,536
4Oct 17, 2026 22:4938,7211,288,750,1041,268,359,0009,441,0002,113,536
5Oct 17, 2026 22:4938,7411,289,465,9911,268,972,0009,511,0002,113,536
6Oct 17, 2026 22:4938,7691,290,645,8851,269,582,0009,825,0002,113,536
7Oct 17, 2026 22:4938,8261,292,391,1311,271,462,0009,799,0002,113,536
8Oct 17, 2026 22:4938,8271,292,477,1221,271,548,0009,764,0002,113,536
9Oct 17, 2026 22:4938,8431,293,023,5591,271,578,00010,259,0002,113,536