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 listMar 9, 2026 21:09Pavel SamyginPavel SamyginScore: 12,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 21:0912,828450,145,965415,344,0007,987,0002,379,776
2Mar 9, 2026 21:0912,849449,570,572416,006,0008,000,0002,314,240
3Mar 9, 2026 21:0912,895449,875,511416,556,0008,990,0002,371,584
4Mar 9, 2026 21:0912,898447,813,689416,637,0008,992,0002,441,216
5Mar 9, 2026 21:0912,909449,822,802416,984,0008,999,0002,379,776
6Mar 9, 2026 21:0912,977451,704,229419,268,0008,984,0002,514,944
7Mar 9, 2026 21:0912,983454,927,587419,445,0008,988,0002,383,872
8Mar 9, 2026 21:0913,010463,033,152419,357,0009,984,0002,502,656
9Mar 9, 2026 21:0913,102454,256,302423,371,0008,986,0002,498,560