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 19:08anboto1anboto1Score: 22,246Success
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 19:0921,939733,402,310717,194,0006,807,0002,113,536
2Jun 7, 2026 19:0921,986735,042,242718,848,0006,714,0002,113,536
3Jun 7, 2026 19:0922,164741,262,089724,615,0006,816,0002,113,536
4Jun 7, 2026 19:0922,169742,057,171724,894,0006,688,0002,113,536
5Jun 7, 2026 19:0922,246743,908,866727,278,0006,860,0002,113,536
6Jun 7, 2026 19:0922,300749,742,407729,099,0006,803,0002,113,536
7Jun 7, 2026 19:0922,401748,813,175732,443,0006,797,0002,113,536
8Jun 7, 2026 19:0922,997768,306,304752,065,0006,866,0002,113,536
9Jun 7, 2026 19:0923,151773,737,668756,880,0007,112,0002,113,536