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 26, 2026 05:42limanjun99limanjun99Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 05:420772,078,510682,851,00070,984,0002,424,832expected "1023811 ", got "1023811nani:1133181584,back:168499524,front:2488665712,"
2Apr 26, 2026 05:420770,362,985672,626,00078,956,0002,539,520expected "1022581 ", got "1022581nani:1133911668,back:166911736,front:2489557820,"
3Apr 26, 2026 05:420776,565,826681,371,00076,929,0002,367,488expected "1025750 ", got "1025750nani:1146560620,back:167931616,front:2511164576,"