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 listApr 15, 2026 05:11olliecrowolliecrowScore: 11,009Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 23:4010,928390,150,859320,660,00039,957,0002,404,352
2Apr 15, 2026 05:1110,947385,586,934308,216,00053,037,0002,437,120
3Apr 1, 2026 23:4010,961391,016,916317,748,00043,965,0002,449,408
4Apr 15, 2026 05:1111,009389,866,113312,245,00051,040,0002,437,120
5Apr 1, 2026 23:4011,035395,164,658312,146,00052,024,0002,441,216
6Apr 15, 2026 05:1111,040398,488,963311,267,00053,045,0002,342,912