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 18, 2026 16:31Charles CabergsCharles CabergsScore: 20,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 16:3120,742622,249,9761,760,565,00019,995,0002,592,768
2Apr 18, 2026 16:3120,859625,774,7151,754,030,00017,979,0002,965,504
3Apr 18, 2026 16:3120,878626,330,6541,763,344,0009,990,0002,703,360
4Apr 18, 2026 16:3120,881626,415,7131,758,909,00018,977,0002,961,408
5Apr 18, 2026 16:3120,894626,834,3321,753,538,00017,995,0002,703,360
6Apr 18, 2026 16:3121,000630,012,5801,758,799,00015,989,0002,965,504
7Apr 18, 2026 16:3121,013630,404,0911,761,668,00010,985,0002,863,104
8Apr 18, 2026 16:3121,118633,551,4911,762,756,00021,984,0002,711,552
9Apr 18, 2026 16:3121,692650,753,3181,822,832,00037,934,0002,588,672