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 29, 2026 13:43TudyMTudyMScore: 27,705Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:4927,554926,953,399893,325,00015,987,0002,314,240
2Apr 29, 2026 13:4927,630934,274,716895,802,00015,996,0002,301,952
3Apr 29, 2026 13:4927,676931,531,044897,325,00015,987,0002,392,064
4Apr 29, 2026 13:4927,678932,181,641894,394,00018,987,0002,297,856
5Apr 29, 2026 13:4927,705934,415,487899,294,00014,988,0002,293,760
6Apr 29, 2026 13:4927,739938,111,094899,409,00015,989,0002,297,856
7Apr 29, 2026 13:4927,773937,602,850901,536,00014,992,0002,297,856
8Apr 29, 2026 13:4927,827941,562,044901,319,00016,987,0002,301,952
9Apr 29, 2026 13:4927,866938,443,312902,599,00016,992,0002,297,856