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 listJun 8, 2026 04:01anboto1anboto1Score: 5,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 04:025,537192,027,713172,538,00010,208,0002,117,632
2Jun 8, 2026 04:025,541192,501,814173,148,0009,710,0002,117,632
3Jun 8, 2026 04:025,546192,278,473173,246,0009,790,0002,117,632
4Jun 8, 2026 04:025,550192,400,886172,954,00010,198,0002,117,632
5Jun 8, 2026 04:025,557195,763,116173,645,0009,747,0002,117,632
6Jun 8, 2026 04:025,560192,794,591173,566,0009,945,0002,117,632
7Jun 8, 2026 04:025,569192,994,959173,598,00010,204,0002,117,632
8Jun 8, 2026 04:025,576193,205,686173,737,00010,279,0002,117,632
9Jun 8, 2026 04:025,613194,955,250175,415,0009,815,0002,117,632