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 22:17olliecrowolliecrowScore: 7,536Success
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 22:197,396221,902,474515,498,00026,973,0002,936,832
2Apr 29, 2026 22:197,458223,744,583515,032,00029,058,0002,572,288
3Apr 29, 2026 22:197,461223,845,272513,961,00026,998,0002,809,856
4Apr 29, 2026 22:197,529225,874,975519,293,00025,062,0002,764,800
5Apr 29, 2026 22:197,536226,083,659512,963,00025,947,0002,662,400
6Apr 29, 2026 22:197,550226,512,902515,929,00027,942,0002,768,896
7Apr 29, 2026 22:197,624228,726,123513,623,00030,095,0002,654,208
8Apr 29, 2026 22:197,681230,440,072534,901,00025,995,0002,850,816
9Apr 29, 2026 22:197,805234,153,207533,113,00027,056,0002,916,352