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 7, 2026 21:29anboto1anboto1Score: 11,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 21:3211,564391,382,780369,051,00012,593,0002,117,632
2Jun 7, 2026 21:3211,689395,046,252373,151,00012,587,0002,117,632
3Jun 7, 2026 21:3211,820399,432,781377,560,00012,503,0002,117,632
4Jun 7, 2026 21:3211,822399,434,588376,790,00013,348,0002,117,632
5Jun 7, 2026 21:3211,836399,898,380378,160,00012,442,0002,117,632
6Jun 7, 2026 21:3211,889401,612,394378,915,00013,426,0002,117,632
7Jun 7, 2026 21:3211,929402,862,893380,388,00013,280,0002,117,632
8Jun 7, 2026 21:3211,934403,498,947380,540,00013,303,0002,117,632
9Jun 7, 2026 21:3211,983405,205,432382,066,00013,376,0002,117,632