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 21, 2026 05:07Charles CabergsCharles CabergsScore: 19,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 05:0819,383581,515,8381,653,858,00014,989,0002,940,928
2Apr 21, 2026 05:0819,387581,628,4821,648,943,00013,991,0002,928,640
3Apr 21, 2026 05:0819,414582,420,4961,649,179,00013,993,0002,703,360
4Apr 21, 2026 05:0819,452583,566,7661,650,903,00014,990,0002,871,296
5Apr 21, 2026 05:0819,482584,477,7411,653,668,00014,987,0002,932,736
6Apr 21, 2026 05:0819,482584,463,9491,661,979,00011,985,0002,965,504
7Apr 21, 2026 05:0819,487584,638,9421,646,413,00016,983,0002,781,184
8Apr 21, 2026 05:0819,621588,642,3561,660,116,00015,981,0002,793,472
9Apr 21, 2026 05:0819,718591,550,3261,656,293,00013,985,0002,932,736