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 18:01M-RochatM-RochatScore: 18,864Success
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 18:0218,116609,379,441594,587,0003,266,0002,113,536
2May 21, 2026 18:0218,473619,913,640606,390,0003,240,0002,113,536
3May 21, 2026 18:0218,491622,007,939606,955,0003,253,0002,113,536
4May 21, 2026 18:0218,531620,962,701608,426,0003,111,0002,113,536
5May 21, 2026 18:0218,864632,321,541619,284,0003,244,0002,113,536
6May 21, 2026 18:0219,451652,860,600638,733,0003,171,0002,113,536
7May 21, 2026 18:0219,707663,043,297647,211,0003,143,0002,113,536
8May 21, 2026 18:0219,824666,420,539651,058,0003,156,0002,113,536
9May 21, 2026 18:0219,859666,652,967652,147,0003,208,0002,113,536