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 20:36TudyMTudyMScore: 28,955Success
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 20:4128,762965,646,778933,730,00015,417,0002,535,424
2May 3, 2026 20:4128,807967,527,767935,156,00015,505,0002,531,328
3May 3, 2026 20:4128,811967,602,708935,217,00015,575,0002,527,232
4May 3, 2026 20:4128,935972,900,087939,168,00015,698,0002,535,424
5May 3, 2026 20:4128,955970,715,172939,788,00015,734,0002,543,616
6May 3, 2026 20:4129,033973,186,363942,417,00015,695,0002,539,520
7May 3, 2026 20:4129,325985,136,021952,371,00015,363,0002,539,520
8May 3, 2026 20:4129,337984,050,705952,548,00015,588,0002,543,616
9May 3, 2026 20:4130,6211,027,492,208994,718,00015,790,0002,539,520