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 29, 2026 15:50TudyMTudyMScore: 16,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 15:5115,575467,267,793862,449,00016,989,0002,715,648
2Apr 29, 2026 15:5115,669470,072,831871,371,00011,004,0002,580,480
3Apr 29, 2026 15:5115,783473,500,821868,476,00016,989,0002,805,760
4Apr 29, 2026 15:5116,345490,366,118911,735,00017,013,0002,535,424
5Apr 29, 2026 15:5116,399491,980,159912,306,00018,985,0002,891,776
6Apr 29, 2026 15:5116,411492,330,985917,889,00011,985,0002,465,792
7Apr 29, 2026 15:5116,495494,868,214920,100,00015,001,0002,531,328
8Apr 29, 2026 15:5116,541496,236,347911,379,00017,987,0002,408,448
9Apr 29, 2026 15:5116,585497,552,676923,849,00012,997,0002,387,968