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 17, 2026 06:30e1011e1011Score: 79,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 06:3177,6252,574,021,7282,552,717,0008,909,0002,113,536
2Oct 17, 2026 06:3177,7862,578,000,4252,557,985,0008,977,0002,113,536
3Oct 17, 2026 06:3177,8422,579,943,6782,559,380,0009,420,0002,113,536
4Oct 17, 2026 06:3178,3342,595,938,4382,576,687,0008,349,0002,113,536
5Oct 17, 2026 06:3179,0472,619,889,6152,600,120,0008,431,0002,113,536
6Oct 17, 2026 06:3179,6972,641,006,0142,621,539,0008,466,0002,113,536
7Oct 17, 2026 06:3180,5762,680,757,2312,650,437,0008,587,0002,113,536
8Oct 17, 2026 06:3182,0682,719,109,1512,699,948,0008,300,0002,113,536
9Oct 17, 2026 06:3182,5032,733,967,9942,714,109,0008,506,0002,113,536