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, 2025 02:08Marco BarboneMarco BarboneScore: 114,189Success
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, 2025 02:08112,8723,760,024,9173,692,788,00031,980,0002,535,424
2Oct 12, 2025 02:08113,1563,765,778,5603,702,171,00031,984,0002,301,952
3Oct 12, 2025 02:08113,4643,772,510,2953,710,352,00033,975,0002,535,424
4Oct 12, 2025 02:08113,5583,771,576,0353,721,443,00025,982,0002,535,424
5Oct 12, 2025 02:08114,1893,797,564,6603,738,249,00029,985,0002,490,368
6Oct 12, 2025 02:08114,3073,801,589,7433,744,159,00027,986,0002,535,424
7Oct 12, 2025 02:08114,3153,804,668,7633,738,428,00033,976,0002,502,656
8Oct 12, 2025 02:08114,4243,808,219,5383,743,007,00032,973,0002,486,272
9Oct 12, 2025 02:08115,1923,831,873,1303,771,346,00029,986,0002,375,680