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:31KeefeKeefeScore: 12,238Success
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:3111,883356,495,538835,413,00029,014,0002,686,976
2May 10, 2025 15:3112,052361,566,292830,562,00032,942,0002,465,792
3May 10, 2025 15:3112,222366,645,251830,181,00034,965,0002,772,992
4May 10, 2025 15:3112,223366,698,756838,517,00036,978,0002,310,144
5May 10, 2025 15:3112,238367,131,150834,328,00034,013,0002,347,008
6May 10, 2025 15:3112,343370,279,880837,919,00032,957,0002,506,752
7May 10, 2025 15:3112,351370,530,591839,656,00036,940,0002,326,528
8May 10, 2025 15:3112,353370,596,918824,092,00034,003,0002,363,392
9May 10, 2025 15:3112,512375,359,888817,553,00035,023,0002,342,912