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 27, 2026 07:23Shikhar SoniShikhar SoniScore: 34,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 07:2434,5191,035,597,9711,016,098,0009,610,0002,125,824
2Jun 27, 2026 07:2434,5261,035,781,5481,015,510,00010,383,0002,125,824
3Jun 27, 2026 07:2434,5531,036,590,2211,017,042,0009,641,0002,125,824
4Jun 27, 2026 07:2434,5941,037,845,0811,017,492,00010,414,0002,125,824
5Jun 27, 2026 07:2434,6121,038,386,2311,018,597,0009,808,0002,125,824
6Jun 27, 2026 07:2434,7571,042,739,2071,022,896,0009,950,0002,125,824
7Jun 27, 2026 07:2436,1421,084,262,5641,063,587,00010,602,0002,125,824
8Jun 27, 2026 07:2436,1991,085,981,0911,065,084,00010,854,0002,125,824
9Jun 27, 2026 07:2436,2121,086,384,4791,065,697,00010,602,0002,125,824