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:07TudyMTudyMScore: 24,902Success
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:1024,796837,012,552799,912,00018,374,0002,531,328
2May 3, 2026 19:1024,807835,000,797799,734,00018,910,0002,535,424
3May 3, 2026 19:1024,842836,561,449801,232,00018,584,0002,539,520
4May 3, 2026 19:1024,857837,642,282801,992,00018,303,0002,527,232
5May 3, 2026 19:1024,902835,947,014803,250,00018,518,0002,527,232
6May 3, 2026 19:1024,957842,895,233805,325,00018,262,0002,543,616
7May 3, 2026 19:1024,961838,687,882804,729,00018,992,0002,539,520
8May 3, 2026 19:1025,273852,407,891815,175,00018,841,0002,551,808
9May 3, 2026 19:1025,278850,901,197815,508,00018,691,0002,543,616