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 listMay 10, 2025 15:13KeefeKeefeScore: 24,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2025 15:1324,248727,427,122696,557,0005,996,0002,600,960
2May 10, 2025 15:1324,259727,757,781694,777,0006,997,0002,600,960
3May 10, 2025 15:1324,317729,496,888694,456,0004,996,0002,555,904
4May 10, 2025 15:1324,334730,019,769697,971,0005,999,0002,666,496
5May 10, 2025 15:1324,347730,424,553699,373,0007,003,0002,494,464
6May 10, 2025 15:1324,504735,115,503697,935,0007,999,0002,596,864
7May 10, 2025 15:1324,516735,480,470702,361,0006,993,0002,609,152
8May 10, 2025 15:1324,611738,334,403702,083,0006,000,0002,662,400
9May 10, 2025 15:1325,462763,868,913731,751,0003,998,0002,543,616