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 listApr 27, 2026 22:50TudyMTudyMScore: 12,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 23:0111,781353,431,806931,003,00064,069,0002,670,592
2Apr 27, 2026 23:0111,792353,787,075935,002,00061,933,0002,801,664
3Apr 27, 2026 23:0111,806354,204,354941,044,00056,002,0002,715,648
4Apr 27, 2026 23:0111,986359,587,367934,757,00061,983,0002,695,168
5Apr 27, 2026 23:0112,029360,893,964964,742,00054,985,0002,682,880
6Apr 27, 2026 23:0112,083362,504,128935,597,00060,038,0002,506,752
7Apr 27, 2026 23:0112,101363,053,975939,467,00056,967,0002,707,456
8Apr 27, 2026 23:0112,118363,547,760958,538,00058,971,0002,633,728
9Apr 27, 2026 23:0112,146364,381,174958,049,00063,936,0002,428,928