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 13:50TudyMTudyMScore: 10,990Success
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 13:5810,724321,723,949867,512,00014,991,0002,744,320
2Apr 29, 2026 13:5810,735322,061,474857,380,00015,006,0003,039,232
3Apr 29, 2026 13:5810,775323,268,244859,558,00020,012,0002,818,048
4Apr 29, 2026 13:5810,882326,467,312862,379,00012,005,0002,646,016
5Apr 29, 2026 13:5810,990329,707,792857,044,00017,979,0002,641,920
6Apr 29, 2026 13:5811,107333,221,318868,834,00014,013,0002,584,576
7Apr 29, 2026 13:5811,485344,573,625909,672,00017,973,0002,809,856
8Apr 29, 2026 13:5811,564346,923,685912,173,00014,002,0002,359,296
9Apr 29, 2026 13:5811,638349,151,759910,490,00014,975,0002,535,424