Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listJun 26, 2026 15:57Shikhar SoniShikhar SoniScore: 49,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 15:5849,2071,476,231,4061,298,742,000167,524,0002,117,632
2Jun 26, 2026 15:5849,2361,477,095,3951,299,609,000167,378,0002,117,632
3Jun 26, 2026 15:5849,3121,479,375,4721,299,958,000169,420,0002,113,536
4Jun 26, 2026 15:5849,3731,481,211,5431,301,320,000169,826,0002,117,632
5Jun 26, 2026 15:5849,3771,481,337,7131,303,204,000166,749,0002,117,632
6Jun 26, 2026 15:5849,3861,481,599,5501,302,008,000169,125,0002,117,632
7Jun 26, 2026 15:5849,4741,484,225,8931,304,472,000169,531,0002,117,632
8Jun 26, 2026 15:5849,5891,487,694,8201,305,472,000172,052,0002,113,536
9Jun 26, 2026 15:5850,1701,505,102,0711,330,198,000164,583,0002,117,632