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 listMay 3, 2026 19:31TudyMTudyMScore: 27,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:3627,416921,787,048886,442,00018,293,0002,535,424
2May 3, 2026 19:3627,470923,873,749888,260,00018,266,0002,539,520
3May 3, 2026 19:3627,483924,680,250887,236,00019,712,0002,539,520
4May 3, 2026 19:3627,577926,965,917891,969,00018,095,0002,543,616
5May 3, 2026 19:3627,592928,679,042892,326,00018,228,0002,535,424
6May 3, 2026 19:3627,629930,107,165893,110,00018,679,0002,535,424
7May 3, 2026 19:3627,777932,976,976898,333,00018,323,0002,539,520
8May 3, 2026 19:3628,137945,772,690910,236,00018,301,0002,539,520
9May 3, 2026 19:3628,391953,669,505918,085,00018,823,0002,539,520