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 listOct 12, 2026 04:36highload-churnerhighload-churnerScore: 9,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 04:379,220313,316,295260,751,00043,512,00020,480
2Oct 12, 2026 04:379,222314,006,349259,124,00045,203,00020,480
3Oct 12, 2026 04:379,240314,209,380260,334,00044,586,00020,480
4Oct 12, 2026 04:379,309316,226,059262,744,00044,475,00020,480
5Oct 12, 2026 04:379,333317,148,027263,561,00044,432,00020,480
6Oct 12, 2026 04:379,354317,657,723264,194,00044,516,00020,480
7Oct 12, 2026 04:379,385318,795,360265,142,00044,578,00020,480
8Oct 12, 2026 04:379,388318,763,356265,226,00044,601,00020,480
9Oct 12, 2026 04:379,497322,535,900268,875,00044,544,00020,480