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 21, 2026 17:56M-RochatM-RochatScore: 22,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 17:5721,919734,057,479717,679,0005,668,0002,113,536
2May 21, 2026 17:5721,955736,280,949718,893,0005,633,0002,113,536
3May 21, 2026 17:5722,098739,936,667723,639,0005,622,0002,113,536
4May 21, 2026 17:5722,105740,270,842723,762,0005,732,0002,113,536
5May 21, 2026 17:5722,199745,298,151726,935,0005,644,0002,113,536
6May 21, 2026 17:5722,268748,850,681729,230,0005,637,0002,113,536
7May 21, 2026 17:5722,643756,840,900741,168,0006,058,0002,113,536
8May 21, 2026 17:5723,776794,978,173778,591,0006,018,0002,113,536
9May 21, 2026 17:5723,894800,883,893782,399,0006,116,0002,113,536