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 8, 2026 01:35anboto1anboto1Score: 9,847Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 01:369,767332,072,208312,587,0009,727,0002,117,632
2Jun 8, 2026 01:369,798332,656,324313,037,00010,325,0002,117,632
3Jun 8, 2026 01:369,824333,460,009313,894,00010,301,0002,117,632
4Jun 8, 2026 01:369,825333,462,500314,036,00010,208,0002,117,632
5Jun 8, 2026 01:369,847335,603,752315,153,0009,825,0002,117,632
6Jun 8, 2026 01:369,894336,278,015316,646,0009,865,0002,117,632
7Jun 8, 2026 01:369,916336,559,648317,017,00010,233,0002,117,632
8Jun 8, 2026 01:3610,025340,147,167321,145,0009,702,0002,117,632
9Jun 8, 2026 01:3611,526389,820,290370,068,00010,295,0002,117,632