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 listDec 21, 2025 21:52zielajzielajScore: 7,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 21:527,449269,507,278184,867,00060,956,0002,437,120
2Dec 21, 2025 21:527,454269,084,804186,976,00058,992,0002,437,120
3Dec 21, 2025 21:527,455273,556,225186,024,00060,007,0002,347,008
4Dec 21, 2025 21:527,459270,285,792183,110,00063,038,0002,289,664
5Dec 21, 2025 21:527,484271,180,838187,976,00058,992,0002,510,848
6Dec 21, 2025 21:527,487268,949,846186,055,00061,018,0002,437,120
7Dec 21, 2025 21:527,496272,540,338185,285,00062,095,0002,457,600
8Dec 21, 2025 21:527,523275,535,378187,189,00061,061,0002,428,928
9Dec 21, 2025 21:527,625271,050,728191,724,00059,913,0002,473,984