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 9, 2026 07:52highload-churnerhighload-churnerScore: 18,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 08:0918,102607,891,576584,574,00012,823,00020,480
2Oct 9, 2026 08:0918,190611,515,829587,197,00013,099,00020,480
3Oct 9, 2026 08:0918,229612,201,702588,734,00012,836,00020,480
4Oct 9, 2026 08:0918,524623,357,869598,555,00012,741,00020,480
5Oct 9, 2026 08:0918,698627,751,714604,368,00012,672,00020,480
6Oct 9, 2026 08:0918,800631,620,749607,689,00012,731,00020,480
7Oct 9, 2026 08:0918,811632,745,308607,847,00012,927,00020,480
8Oct 9, 2026 08:0919,010638,686,060614,308,00013,030,00020,480
9Oct 9, 2026 08:0919,072640,158,720616,710,00012,675,00020,480