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 27, 2026 22:25TudyMTudyMScore: 15,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:3014,923447,705,5001,255,648,00032,964,0002,940,928
2Apr 27, 2026 22:3015,060451,821,2671,251,343,00036,038,0002,572,288
3Apr 27, 2026 22:3015,168455,040,9791,252,421,00031,010,0003,022,848
4Apr 27, 2026 22:3015,219456,595,1921,246,943,00038,998,0002,486,272
5Apr 27, 2026 22:3015,417462,519,5841,282,406,00039,919,0002,498,560
6Apr 27, 2026 22:3015,433463,000,6901,287,032,00035,945,0002,842,624
7Apr 27, 2026 22:3015,438463,165,4661,292,356,00030,936,0002,621,440
8Apr 27, 2026 22:3015,481464,449,5671,294,820,00031,019,0002,629,632
9Apr 27, 2026 22:3015,503465,091,4871,285,849,00036,938,0002,854,912