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 listDec 20, 2025 10:16Rajarshi BasuRajarshi BasuScore: 6,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 10:166,522195,660,707166,012,0006,000,0002,768,896
2Dec 20, 2025 10:166,539196,156,406166,994,0004,999,0002,768,896
3Dec 20, 2025 10:166,607198,215,108166,322,0005,009,0002,654,208
4Dec 20, 2025 10:166,662199,849,446167,057,0006,002,0002,576,384
5Dec 20, 2025 10:166,689200,669,894165,409,0006,014,0002,543,616
6Dec 20, 2025 10:166,700200,991,698166,406,0006,014,0002,768,896
7Dec 20, 2025 10:166,702201,058,745164,334,0007,014,0002,772,992
8Dec 20, 2025 10:166,706201,180,866168,749,0003,994,0002,768,896
9Dec 20, 2025 10:166,775203,247,494164,673,0006,986,0002,760,704