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 22, 2026 20:02M-RochatM-RochatScore: 18,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:0318,320614,709,377598,442,0006,129,0002,138,112
2May 22, 2026 20:0318,394617,088,071599,825,0007,194,0002,125,824
3May 22, 2026 20:0318,478622,051,179603,636,0006,143,0002,125,824
4May 22, 2026 20:0318,559623,907,621605,275,0007,202,0002,138,112
5May 22, 2026 20:0318,611625,032,173607,995,0006,178,0002,125,824
6May 22, 2026 20:0318,624627,200,679608,396,0006,227,0002,138,112
7May 22, 2026 20:0318,681626,928,524610,276,0006,210,0002,138,112
8May 22, 2026 20:0318,828631,720,506615,149,0006,201,0002,138,112
9May 22, 2026 20:0320,391684,781,479666,785,0006,139,0002,125,824